Paper 2023/876
Circular Multiplicative Modular Exponentiation: A New Public Key Exchange Algorithm
Abstract
The major objective of this paper is to present a theoretical model for an algorithm that has not been previously described in the literature, capable of generating a secret key through the transmission of data over a public channel. We explain how the method creates a shared secret key by attaining commutativity through the multiplication of the modular exponentiation of a minimum of two bases and an equal number of private exponents for each party involved in the exchange. In addition, we explore the relationship between CMME and the traditional Diffie-Hellman scheme. We just briefly discuss the algorithm's security, opting to leave the essential investigation to cryptanalysts, while we elucidate on the algorithm's mechanism by illustrating some cases.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- public key cryptographymultiplicative modular exponentiationpublic key exchange schemekey distribution problem
- Contact author(s)
- cmme @ fabbrini org
- History
- 2023-06-12: approved
- 2023-06-08: received
- See all versions
- Short URL
- https://ia.cr/2023/876
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/876,
author = {Michele Fabbrini},
title = {Circular Multiplicative Modular Exponentiation: A New Public Key Exchange Algorithm},
howpublished = {Cryptology ePrint Archive, Paper 2023/876},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/876}},
url = {https://eprint.iacr.org/2023/876}
}
