Group-based cryptography

Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes use groups in some way. In particular Diffie–Hellman key exchange uses finite cyclic groups. So the term group-based cryptography refers mostly to cryptographic protocols that use infinite non-abelian groups such as a braid group.

Examples

• Shpilrain–Zapata public-key protocols
• Magyarik–Wagner public key protocol
• Anshel–Anshel–Goldfeld key exchange
• Ko–Lee et al. key exchange protocol

See also

• Non-commutative cryptography

• Myasnikov, A.G.; Shpilrain, V.; Ushakov, A. (2008). . Advanced Courses in Mathematics – CRM Barcelona. Birkhauser. ISBN9783764388270.
• Myasnikov, A.G.; Shpilrain, V.; Ushakov, A. (2011). Non-commutative cryptography and complexity of group-theoretic problems. Amer. Math. Soc. Surveys and Monographs. ISBN9780821853603.
• Magyarik, M.R.; Wagner, N.R. (1985). . Advances in Cryptology—CRYPTO 1984. Lecture Notes in Computer Science. Vol.196. Springer. pp.19–36. doi:. ISBN978-3-540-39568-3.
• Anshel, I.; Anshel, M.; Goldfeld, D. (1999). (PDF). Math. Res. Lett. 6 (3): 287–291. CiteSeerX. doi:.
• Ko, K.H.; Lee, S.J.; Cheon, J.H.; Han, J.W.; Kang, J.; Park, C. (2000). . Advances in Cryptology—CRYPTO 2000. Lecture Notes in Computer Science. Vol.1880. Springer. pp.166–183. CiteSeerX. doi:. ISBN978-3-540-44598-2.
• Shpilrain, V.; Zapata, G. (2006). "Combinatorial group theory and public key cryptography". Appl. Algebra Eng. Commun. Comput. 17 (3–4): 291–302. arXiv:. CiteSeerX. doi:. S2CID.

Further reading

• Paul, Kamakhya; Goswami, Pinkimani; Singh, Madan Mohan. (2022). , , Vol. 52(2) (2022), 218-223. ISSN 0304-9892 (Print) ISSN 2455-7463 (Online)

External links

• (archived version 7/17/2017)