A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations
Doing arithmetic in finite field is the key part to the implementation of communication and coding system including the newly developed Rijndael the Advanced Encryption Standard (AES). This encryption standard uses KeyExpansion, ByteSub, Mixcolumn and Shiftrow functions which consists of XOR, in...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/8711/ http://psasir.upm.edu.my/id/eprint/8711/1/FSKTM_2004_5%20IR.pdf |
| _version_ | 1848840946254348288 |
|---|---|
| author | Mohd Ali, Fakariah Hani |
| author_facet | Mohd Ali, Fakariah Hani |
| author_sort | Mohd Ali, Fakariah Hani |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Doing arithmetic in finite field is the key part to the implementation of
communication and coding system including the newly developed Rijndael the
Advanced Encryption Standard (AES). This encryption standard uses
KeyExpansion, ByteSub, Mixcolumn and Shiftrow functions which consists of
XOR, inverse, multiplying and swap modules. Among them, inverse and
multiplier are the most complex modules with longer delay. These modules are
included in the Mixcolumn function. From the proposal of AES, the
Mixcolumn function was suggested to solve the problem of delay by using
look-up tables. This function can be integrated into a bigger table to replace the
calculations of inverse and multiply operations, if it provides enough memory.
In fact, too many tables are needed for various irreducible polynomials that this
system is not flexible and expandable. The area for lookup tables becomes huge when multiple round units are implemented. This research proposes the use of
cyclic shift and bit wise XOR operation as new approach to replace the lookup
table. The principle benefit of using this new approach over the transform from
Rijndael block cipher is speed. This new approach has shown the excellent
result, which faster then Rijndael. The new approach algorithm speed
increment has consistently increased in between 18% to 22% microsecond for
encryption and 30% to 34% for decryption compared to Rijndael algorithm. |
| first_indexed | 2025-11-15T07:35:25Z |
| format | Thesis |
| id | upm-8711 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T07:35:25Z |
| publishDate | 2004 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-87112023-12-28T02:18:37Z http://psasir.upm.edu.my/id/eprint/8711/ A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations Mohd Ali, Fakariah Hani Doing arithmetic in finite field is the key part to the implementation of communication and coding system including the newly developed Rijndael the Advanced Encryption Standard (AES). This encryption standard uses KeyExpansion, ByteSub, Mixcolumn and Shiftrow functions which consists of XOR, inverse, multiplying and swap modules. Among them, inverse and multiplier are the most complex modules with longer delay. These modules are included in the Mixcolumn function. From the proposal of AES, the Mixcolumn function was suggested to solve the problem of delay by using look-up tables. This function can be integrated into a bigger table to replace the calculations of inverse and multiply operations, if it provides enough memory. In fact, too many tables are needed for various irreducible polynomials that this system is not flexible and expandable. The area for lookup tables becomes huge when multiple round units are implemented. This research proposes the use of cyclic shift and bit wise XOR operation as new approach to replace the lookup table. The principle benefit of using this new approach over the transform from Rijndael block cipher is speed. This new approach has shown the excellent result, which faster then Rijndael. The new approach algorithm speed increment has consistently increased in between 18% to 22% microsecond for encryption and 30% to 34% for decryption compared to Rijndael algorithm. 2004-02 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/8711/1/FSKTM_2004_5%20IR.pdf Mohd Ali, Fakariah Hani (2004) A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations. Masters thesis, Universiti Putra Malaysia. Arithmetic Cryptography English |
| spellingShingle | Arithmetic Cryptography Mohd Ali, Fakariah Hani A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title | A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title_full | A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title_fullStr | A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title_full_unstemmed | A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title_short | A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations |
| title_sort | faster version of rijndael cryptograpic algorithm using cyclic shift and bitwise operations |
| topic | Arithmetic Cryptography |
| url | http://psasir.upm.edu.my/id/eprint/8711/ http://psasir.upm.edu.my/id/eprint/8711/1/FSKTM_2004_5%20IR.pdf |