article Open Access
Nilpotent groups in cryptographic key exchange protocol for N≥ 1
Journal of Mathematical Problems Equations and Statistics · 2023 · Vol. 4(2) · pp. 32–34
Michael N. John✉(Akwa Ibom State University)Udoaka Otobong G(University of Port Harcourt)Alex Musa(University of Port Harcourt)
Abstract
This paper provides a thorough exploration of the applications of nilpotent groups for some n ≥ 1 in cryptography, focusing on their unique algebraic properties and their role in designing secure cryptographic systems. Through an in-depth analysis of cryptographic protocols utilizing nilpotent groups, this paper contributes to a deeper understanding of the potential and computational integration of nilpotent groups which isa key to quantum era cryptography.
Coding theory and cryptographyCryptography and Residue ArithmeticCryptography and Data SecurityCryptographyKey exchangeCryptographic protocolNilpotentComputer scienceKey (lock)Theoretical computer scienceProtocol (science)Cryptographic primitiveAlgebraic number
Citations
2
FWCI
0.35
field-weighted impact
References
7
Percentile
67%
vs. same field & year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.