Algebraic Analysis of Cryptosystems

本课题研究现代分组密码分析的一种（新的）代数方法。这种方法适用于所有使用小s盒的密码系统，或者它们的代数结构可以用一个超定义的二次方程系统来描述。使用这种方法可能被破解的密码系统是Rijndael和Serpent——这是高级加密标准竞赛的两个决赛选手。该项目还探讨了如何将这种方法应用于设计新的、更强大的因子分解算法。该项目具有重新定义现代密码学理论和实践的爆炸性潜力。

This project studies an (new) algebraic approach to cryptanalysis of modern block ciphers. The approach works for all cryptosystems that use either small S-boxes, or their algebraic structure can be described by a system of overdefined quadratic equations. The cryptosystems that are potentially breakable using this approach are Rijndael and Serpent - the two top finalists of the Advanced Encryption Standard contest. The project also explores how this approach can be applied to design new and more powerful factoring algorithms. The project has an explosive potential to redefine the theory and practice of modern cryptography.