利用生成式对抗网络增强密码密钥生成能力

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Purushottam Singh, Prashant Pranav, Shamama Anwar, Sandip Dutta
{"title":"利用生成式对抗网络增强密码密钥生成能力","authors":"Purushottam Singh,&nbsp;Prashant Pranav,&nbsp;Shamama Anwar,&nbsp;Sandip Dutta","doi":"10.1002/cpe.8226","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In 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.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Leveraging generative adversarial networks for enhanced cryptographic key generation\",\"authors\":\"Purushottam Singh,&nbsp;Prashant Pranav,&nbsp;Shamama Anwar,&nbsp;Sandip Dutta\",\"doi\":\"10.1002/cpe.8226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>In 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.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 22\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8226\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8226","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要在这项研究中,我们提出了一种利用生成对抗网络(GAN)生成密钥的创新方法,并通过默克尔树验证进行了增强,这标志着加密安全领域的重大进步。我们的方法成功生成了 6272 位的大型密钥,并使用 Dieharder 和 NIST 测试套件对随机性和可靠性进行了严格测试。这种开创性的方法将前沿的机器学习技术与传统的密码验证技术和谐地结合在一起,为数据加密和安全设定了新的标准。我们的研究结果不仅证明了 GANs 在生成高度安全的加密密钥方面的功效,而且还强调了默克尔树验证在确保这些密钥完整性方面的有效性。在我们的方法中集成默克尔树提供了一种有效验证大型生成密钥集真实性的方法。这项研究对未来的安全通信有着广泛的影响,为日益依赖数字安全的世界提供了一个强大的解决方案。机器学习与密码学原理的结合为研究和开发开辟了新途径,有望在数字威胁不断演变的时代加强安全措施。这项工作为密码学领域做出了重大贡献,为应对数字数据保护的挑战提供了新颖的视角和强大的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Leveraging generative adversarial networks for enhanced cryptographic key generation

In 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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信