Paper 2024/825
KHAN Encryption Algorithm: Leveraging Full Reptend Primes
Abstract
The Keyed Hashing and Asymmetric Nonce (KHAN) encryption algorithm is a novel cryptographic scheme that utilizes the unique properties of full reptend prime numbers. This paper details the algorithm, its theoretical foundations, and the rigorous proofs of its security properties. By leveraging the characteristics of cyclic sequences derived from full reptend primes, KHAN provides robust encryption with high resistance to cryptanalytic attacks.
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Full Reptend PrimesCyclic SequencesEncryptionDecryptionSecurityCryptanalysisImplementationAlgorithms
- Contact author(s)
- khanayaz2727 @ gmail com
- History
- 2024-05-31: approved
- 2024-05-27: received
- See all versions
- Short URL
- https://ia.cr/2024/825
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2024/825, author = {Ayaz Khan}, title = {{KHAN} Encryption Algorithm: Leveraging Full Reptend Primes}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/825}, year = {2024}, url = {https://eprint.iacr.org/2024/825} }