Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard
As we know Cryptology is divided into two parts: “Cryptography” and “Cryptanalysis”. Since block ciphers can be deployed in many different applications, so we focus on Advanced Encryption Standard (AES) which is the successor of Data Encryption Standard (DES). In cryptography, we purpose new block...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/19692/ http://psasir.upm.edu.my/id/eprint/19692/1/IPM_2011_4.pdf |
| _version_ | 1848843796638334976 |
|---|---|
| author | Rezaeipour, Davood |
| author_facet | Rezaeipour, Davood |
| author_sort | Rezaeipour, Davood |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | As we know Cryptology is divided into two parts: “Cryptography” and “Cryptanalysis”. Since block ciphers can be deployed in many different applications,
so we focus on Advanced Encryption Standard (AES) which is the successor of Data Encryption Standard (DES).
In cryptography, we purpose new block cipher (NBC08) in order to understand the inner structure and other known properties. NBC08 accepts an variable-length key
up to 512 bits, which is an improved security/performance tradeoff over existing block ciphers. It cannot be analyzed by known cryptanalytic attacks.
We study AES specifications and also the algebraic structure for AES over Galois Fields GF(2) and GF(28). We describe the most common cryptanalytic techniques on
block ciphers, such as Differential, Linear and Integral cryptanalysis.
We study the different solving methods for system of equations of AES in both fields, GF(2) and GF(28). The process of performing these methods on AES acts as
Algebraic attack.
In cryptanalysis, we improve the algebraic cryptanalysis attack on the reduced-round AES. It’s called Ground Algebraic attack. The notable property of Ground attack is
that less requirements to any information for analyzing AES. Ground Algebraic attack is the first attack on reduced-round AES which can break 4-round and 5- round AES by respectively 256 and 2113.5 computational complexities. The number of required chosen plaintexts for cryptanalysis 4-round and 5-round AES is 8 and 15,respectively. |
| first_indexed | 2025-11-15T08:20:43Z |
| format | Thesis |
| id | upm-19692 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T08:20:43Z |
| publishDate | 2011 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-196922014-06-16T03:14:13Z http://psasir.upm.edu.my/id/eprint/19692/ Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard Rezaeipour, Davood As we know Cryptology is divided into two parts: “Cryptography” and “Cryptanalysis”. Since block ciphers can be deployed in many different applications, so we focus on Advanced Encryption Standard (AES) which is the successor of Data Encryption Standard (DES). In cryptography, we purpose new block cipher (NBC08) in order to understand the inner structure and other known properties. NBC08 accepts an variable-length key up to 512 bits, which is an improved security/performance tradeoff over existing block ciphers. It cannot be analyzed by known cryptanalytic attacks. We study AES specifications and also the algebraic structure for AES over Galois Fields GF(2) and GF(28). We describe the most common cryptanalytic techniques on block ciphers, such as Differential, Linear and Integral cryptanalysis. We study the different solving methods for system of equations of AES in both fields, GF(2) and GF(28). The process of performing these methods on AES acts as Algebraic attack. In cryptanalysis, we improve the algebraic cryptanalysis attack on the reduced-round AES. It’s called Ground Algebraic attack. The notable property of Ground attack is that less requirements to any information for analyzing AES. Ground Algebraic attack is the first attack on reduced-round AES which can break 4-round and 5- round AES by respectively 256 and 2113.5 computational complexities. The number of required chosen plaintexts for cryptanalysis 4-round and 5-round AES is 8 and 15,respectively. 2011-01 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/19692/1/IPM_2011_4.pdf Rezaeipour, Davood (2011) Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard. PhD thesis, Universiti Putra Malaysia. Cryptography Data encryption (Computer science) English |
| spellingShingle | Cryptography Data encryption (Computer science) Rezaeipour, Davood Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title | Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title_full | Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title_fullStr | Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title_full_unstemmed | Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title_short | Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard |
| title_sort | improved algebraic cryptanalysis of the reduced-round advanced encryption standard |
| topic | Cryptography Data encryption (Computer science) |
| url | http://psasir.upm.edu.my/id/eprint/19692/ http://psasir.upm.edu.my/id/eprint/19692/1/IPM_2011_4.pdf |