CRYPTOGRAPHY AND ALGEBRAIC APPLICATIONS, INVERTIBILITY OF EXPONENTIATION MAPS AND SECURITY ASSUMPTIONS
PDF

Keywords

RSA
modular arithmetic
bijection
cyclic group
Diffie-Hellman
elliptic curve
computational verification 1 Introduction In public-key cryptography

How to Cite

Xilola Qobil-qizi Yaxshilikova. (2026). CRYPTOGRAPHY AND ALGEBRAIC APPLICATIONS, INVERTIBILITY OF EXPONENTIATION MAPS AND SECURITY ASSUMPTIONS. Academic Journal of Science, Technology and Education, 2(11), 59–64. Retrieved from https://integrumpublication.org/index.php/ajste/article/view/340

Abstract

This article examines the algebraic correctness of RSA, Diffie-Hellman, and elliptic- curve key-agreement mechanisms separately from their security assumptions. The aim is to delineate the logical boundaries between the invertibility of exponentiation maps, the equality of shared values, and resistance to attacks. The investigation is based on theoretical proofs, counterexamples that violate the requisite conditions, and exhaustive enumeration of finite models. For RSA, a bijectivity criterion for exponentiation modulo a product of distinct primes is established using the Chinese remainder theorem. It is shown that violating the exponent condition causes distinct messages to map to the same value, whereas, when the modulus is not squarefree, a condition imposed on the group of units is insufficient for all messages. Computational checks examined 143 RSA messages, 100 pairs of exponents in a prime-order Diffie-Hellman subgroup, 361 additions in an elliptic-curve group, and 6,859 associativity instances. No discrepancies were observed in models with valid parameters; with an invalid RSA exponent, only 18 distinct ciphertexts were produced. The results explicitly distinguish algebraic correctness conditions from security requirements. The contribution of this work consists in combining established algebraic results with positive and negative computational checks; no new cryptosystem is proposed. Computations with small parameters do not assess practical security. The conclusions substantiate the independent importance of authentication, standardized encoding, and key derivation.
PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.