Strengthening AES Encryption: A Novel Approach Using Prime Number-Based Passwords
DOI:
https://doi.org/10.32628/CSEIT25113346Keywords:
Advanced Encryption Standard, Prime numbers, Encryption, Decryption.Abstract
This paper explores the enhancement of Advanced Encryption Standard (AES) encryption by integrating prime number sequences into password generation. Prime numbers, known for their mathematical properties, are utilized to create robust passwords that augment the security of AES encryption. The research demonstrates the implementation of this approach using the Web Crypto API, highlighting its effectiveness in strengthening cryptographic operations in web browsers.
References
- Maurer, U. (1995). Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. Journal of Cryptology, 8(3), 123–155.(crypto.ethz.ch)
- Bach, E. (1988). How to generate factored random numbers. SIAM Journal on Computing, 17(5), 904–916. (Wikipedia)
- Daemen, J., & Rijmen, V. (2002). The Design of Rijndael: AES – The Advanced Encryption Standard. Springer.(TechNewsWorld)
- Elliptic Curve Primality Proving (ECPP). (1986). Mathematics of Computation. (Wikipedia)
- Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177), 203–209.
- Miller, V. S. (1986). Use of elliptic curves in cryptography. In Advances in Cryptology – CRYPTO '85 Proceedings (pp. 417–426). Springer.
- NIST. (2001). FIPS PUB 197: Announcing the Advanced Encryption Standard (AES). National Institute of Standards and Technology.(Wikipedia)
- Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120–126.
- Shoup, V. (2008). A Computational Introduction to Number Theory and Algebra. Cambridge University Press.(Wikipedia)
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

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