Akutra coded and studied multiple encryption algorithms while in CSC380O. In the first week of the class he developed a utility which he labeled AESCipherKey and included two
such encryption algorithms, AES and DES.
In the project AESCipherKey, Akutra created an interface that allows the user to process the AES Encryption algorithm in internal algorithm process stages. After having the
program process one of the stages of the encryption algorithm, the utility would report the results to the screen allowing the user to see the progress every step of the
encryption process.
After Expanding the key, one could cycle through the standard AES encryption phases of 'Add round Key', 'Substitution', 'Shift Rows' and the inital 'Mix Columns'. Results would
be output to the screen. This inital methodology was how he troublshot the functionality of each part of the algorithm to ensure proper results.
The utility also allowed the user to encrypt via the simpler DES encryption as a secondary option by clicking on the DES Encrypt button where it would again report to the screen
several resulting output parameters.
AESCipherKey Video
RaySorter CSC280O Data Structures I
Akutra coded and studied several sorting algorithms while in CSC280O. It quickly became apparent there would need to be benchmark tool to assist with the selection
of the most desirable sorting algorithm for any given task.
In the project RaySorter, Akutra created sample arrays of multiple sizes and benchmarked two sorting algorithms (Quick Sort and Index Sort). Designing a simple interface
he made it possible to easily get measured results as well as to utilize the basic structure to benchmark other sorting algorithms as well.
Ray Sorter Video
RaySearcher CSC313O Operating Systems Theory
Akutra coded and studied several searching algorithms while in CSC313O. It quickly became apparent there would need to be benchmark tool to assist with the selection
of the most desirable searching algorithm for any given task.
In the project RaySearcher, Akutra created sample arrays of multiple sizes and benchmarked two searching methods (Brute Search and Index Search). Designing a simple
interface he made it possible to easily get measured results as well as to utilize the basic structure to benchmark other searching algorithms as well.