Abstract
We introduce a new family of symmetric block ciphers based on group bases. The main advantage of our approach is its full scalability. It enables us to construct, for instance, a trivial 8-bit Caesar cipher as well as a strong 256-bit cipher with 512-bit key, both from the same specification. We discuss the practical aspects of the design, especially the choice of carrier groups, generation of random group bases and an efficient factorization algorithm. We also describe how the cryptographic properties of the system are optimized, and analyze the influence of parameters on its security. Finally we present some experimental results regarding the speed and security of concrete ciphers from the family.
Cite
CITATION STYLE
Čanda, V., Van Trung, T., Magliveras, S., & Horváth, T. (2001). Symmetric block ciphers based on group bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2012, pp. 89–105). Springer Verlag. https://doi.org/10.1007/3-540-44983-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
