Affiliation:
1. Department of Computer Science and Engineering Birla Institute of Technology, Mesra Ranchi India
Abstract
SummaryIn this research, we present an innovative cryptographic key generation method utilizing a Generative Adversarial Network (GAN), enhanced by Merkel tree verification, marking a significant advancement in cryptographic security. Our approach successfully generates a large 6272‐bit key, rigorously tested for randomness and reliability using the Dieharder and NIST test suites. This groundbreaking method harmoniously blends cutting‐edge machine learning techniques with traditional cryptographic verification, setting a new standard in data encryption and security. Our findings not only demonstrate the efficacy of GANs in producing highly secure cryptographic keys but also highlight the effectiveness of Merkel tree verification in ensuring the integrity of these keys. The integration of merkel tree in our method provides a means to efficiently verify the authenticity of the large generated key sets. This research has broad implications for the future of secure communications, providing a robust solution in a world increasingly reliant on digital security. The integration of machine learning and cryptographic principles opens up new avenues for research and development, promising to bolster security measures in an era where digital threats are constantly evolving. This work contributes significantly to the field of cryptography, offering a novel perspective and robust solutions to the challenges of digital data protection.