Novel Protocols in Group-based Cryptography

  • Serge Horbach Radboud University Nijmegen


In this research we propose new protocols in group-based cryptography contributing to the research of finding novel cryptographic systems that are secure against quantum computers. The protocols we introduce either employ different one-way functions or different groups then the currently available protocols in group-based cryptography. Thereby, we avoid the successful attacks that threaten the contemporary existing group-based cryptosystems.


1. Anshel I., Anshel M., Goldfeld D., ‘An Algebraic Method for Public Key Cryptography’. Math.Res.Lett, vol. 6, Springer Verlag, pp 287-291, 1999.

2. Bosma W. and Cannon J., ‘MAGMA Handbook’, Sydney, 1993.

3. Horbach S., ‘Group-based Cryptography’, Bachelor Thesis, Radboud University, Nijmegen, 2014.

4. Ko K., Lee J. et al.: ‘New Public-key Cryptography using BraidGroups’. Advances in Cryptology - CRYPTO 2000, Lecture Notes in Computer Science, Springer, vol. 1880, pp 166 - 183, 2000.

5. Lenstra A. and Verheul E., ‘Selecting Cryptographic Key Sizes’. Public Key cryptography, Lecture Notes in Computer Science, vol. 1751, Springer-Verlag, pp 446 - 465, 2000.

6. Luks E.M., ‘Permutation Groups and Polynomial-Time Computation’. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp 139 - 175, 1993.

7. Myasnikov A., Shpilrain V., Ushakov A., ‘Group-based cryptography’, Advanced Courses in Mathematics, CRM Barcelona, 2007.

8. Overbeck R. and Sendrier N., ‘Code-based cryptography’. Post-Quantum Cryptography 2009, Springer, pp 95 - 145, 2009.

9. Sendrier N. and Simos D.E., ‘The hardness of code equivalence over Fq and its applications to Code-Based cryptography’. Post-Quantum Cryptography, Lecture Notes in computer Science, vol. 7932, Springer-Verlag, pp. 203 - 216, 2013

Author Biography

Serge Horbach, Radboud University Nijmegen
How to Cite
HORBACH, Serge. Novel Protocols in Group-based Cryptography. Student Undergraduate Research E-journal!, [S.l.], v. 1, nov. 2015. ISSN 2468-0443. Available at: <>. Date accessed: 19 feb. 2019.