Cryptosystems using linear groups

DOI10.1007/s00200-006-0003-zzbMath1104.94017OpenAlexW2021676666MaRDI QIDQ2432558

Gilbert Baumslag, Benjamin Fine, Xiao-Wei Xu

Publication date: 25 October 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-006-0003-z

zbMATH Keywords

Reidemeister-Schreier processFree groupModular groupCryptosystemLinear group

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Cryptography (94A60)

Related Items (7)

Rewriting system of certain semigroups with three generators ⋮ Affine braid groups: a better platform than braid groups for cryptology? ⋮ Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem ⋮ Algorithmic problems in Engel groups and cryptographic applications ⋮ Properties of certain semigroups and their potential as platforms for cryptosystems ⋮ Some applications of arithmetic groups in cryptography ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography

Cites Work

• An algebraic method for public-key cryptography
• Free subgroups in linear groups
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cryptosystems using linear groups