Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Essential Algebraic Structure within the AES
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
In How Many Ways Can You Write Rijndael?
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
3D: A Three-Dimensional Block Cipher
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
A survey of confidential data storage and deletion methods
ACM Computing Surveys (CSUR)
AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
The price of security in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
FOX: a new family of block ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
A zero-dimensional gröbner basis for AES-128
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
The cryptanalysis of the AES – a brief survey
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
Some algebraic aspects of the advanced encryption standard
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
General principles of algebraic attacks and new design criteria for cipher components
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
An algebraic interpretation of AES-128
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
Complementation-Like and cyclic properties of AES round functions
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
Representations and rijndael descriptions
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
The inverse s-box, non-linear polynomial relations and cryptanalysis of block ciphers
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
Construction of S8 Liu J S-boxes and their applications
Computers & Mathematics with Applications
Exposing WPA2 security protocol vulnerabilities
International Journal of Information and Computer Security
| Hi-index | 0.00 |
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations of any other block cipher we know. The security of Rijndael depends on a new and untested hardness assumption: it is computationally infeasible to solve equations of this type. The lack of research on this new assumption raises concerns over the wisdom of using Rijndael for security-critical applications.