Group-based cryptography
Jump to navigation
Jump to search
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
[edit | edit source]- Shpilrain–Zapata public-key protocols
- Magyarik–Wagner public key protocol
- Anshel–Anshel–Goldfeld key exchange
- Ko–Lee et al. key exchange protocol
See also
[edit | edit source]References
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Further reading
[edit | edit source]- Paul, Kamakhya; Goswami, Pinkimani; Singh, Madan Mohan. (2022). "ALGEBRAIC BRAID GROUP PUBLIC KEY CRYPTOGRAPHY", Jnanabha, Vol. 52(2) (2022), 218-223. ISSN 0304-9892 (Print) ISSN 2455-7463 (Online)
External links
[edit | edit source]- Cryptography and Braid Groups page (archived version 7/17/2017)