{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:32Z","timestamp":1772119892232,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11277-024-11452-1","type":"journal-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T08:01:42Z","timestamp":1721030502000},"page":"1761-1772","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Algorithm for Secure Data Communication by Extension of Key-Space Dimension"],"prefix":"10.1007","volume":"137","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3102-5580","authenticated-orcid":false,"given":"Nitin","family":"Uniyal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,15]]},"reference":[{"key":"11452_CR1","doi-asserted-by":"crossref","unstructured":"W. Diffie, M. Hellman, New Directions in Cryptography, IEEE Transaction on Information Theory, Vol. IT-22, No. 6, 1976","DOI":"10.1109\/TIT.1976.1055638"},{"issue":"5","key":"11452_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.25046\/aj020501","volume":"2","author":"A Subandi","year":"2017","unstructured":"Subandi, A., Meiyanti, R., Sandy, C. L. M., & Sembiring, R. W. (2017). Three-pass protocol implementation in vigenere cipher classic cryptography algorithm with keystream generator modification. Advances in Science, Technology and Engineering Systems Journal, 2(5), 1\u20135.","journal-title":"Advances in Science, Technology and Engineering Systems Journal"},{"issue":"4","key":"11452_CR3","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C. E. (1949). Communication theory of secrecy systems. Bell Systems Technical Journal, 28(4), 656\u2013715.","journal-title":"Bell Systems Technical Journal"},{"key":"11452_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, A. O\u2019 Neill, Deterministic and efficiently searchable encryption, Advances in Cryptology\u2013 CRYPTO \u201807, LNCS Vol. 4622, pp. 535\u2013552, 2007.","DOI":"10.1007\/978-3-540-74143-5_30"},{"issue":"2","key":"11452_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S. (1984). Silvio micali, probabilistic encryption, special issue. Journal of Computer and System Sciences, 28(2), 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"11452_CR6","unstructured":"W. Stallings, Cryptography and Network Security: Principles and Practices. Prentice Hall, 2005"},{"key":"11452_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9781118027974","volume-title":"Information Security: Principles and Practice","author":"M Stamp","year":"2011","unstructured":"Stamp, M. (2011). Information Security: Principles and Practice. London: Wiley."},{"issue":"6","key":"11452_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.14569\/IJACSA.2017.080659","volume":"8","author":"F Maqsood","year":"2017","unstructured":"Maqsood, F., Ali, M. M., Ahmed, M., & Shah, M. A. (2017). Cryptography: A comparative analysis for modern techniques. International Journal of Advanced Computer Science and Applications, 8(6), 442\u2013448.","journal-title":"International Journal of Advanced Computer Science and Applications"},{"key":"11452_CR9","unstructured":"J. Katz, Y. Lindell, Introduction to Modern Cryptography, Chapman & Hall\/CRC."},{"issue":"1","key":"11452_CR10","doi-asserted-by":"publisher","first-page":"012003","DOI":"10.1088\/1757-899X\/308\/1\/012003","volume":"308","author":"D Rachmawati","year":"2018","unstructured":"Rachmawati, D., Budiman, M. A., & Aulya, L. (2018). Three-pass protocol scheme for bitmap image security by using Vernam cipher algorithm. IOP Conference Series: Materials Science and Engineering, 308(1), 012003.","journal-title":"IOP Conference Series: Materials Science and Engineering"},{"key":"11452_CR11","doi-asserted-by":"crossref","unstructured":"Y. Rachlin and D. Baron, The Secrecy of Compressed Sensing Measurements, IEEE Transactions.In: Forty-Sixth Annual Allerton Conference, Vol. 52, Allerton House, UIUC, Illinois, USA September 23-26, 2008.","DOI":"10.1109\/ALLERTON.2008.4797641"},{"key":"11452_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1235\/1\/012030","volume":"1235","author":"AR Dalimunthe","year":"2019","unstructured":"Dalimunthe, A. R., Mawengkang, H., Suwilo, S., & Nazam, A. (2019). Vernam cipher with complement method and optimization key with genetic algorithm. Journal of Physics Conference Series, 1235, 012030.","journal-title":"Journal of Physics Conference Series"},{"key":"11452_CR13","doi-asserted-by":"crossref","unstructured":"S. S. Hatkar, B. K. Pawar. Symmetric key algorithm using vernam cipher: VSA, IEEE: International Conference on Inventive Computation Technologies, Vol. 3, 2016","DOI":"10.1109\/INVENTIVE.2016.7830196"},{"key":"11452_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.26421\/QIC1.1-1","volume":"1","author":"Y Heights","year":"2001","unstructured":"Heights, Y. (2001). Quantum Vernam cipher. Quantum Information and Computation, 1, 1\u201321.","journal-title":"Quantum Information and Computation"},{"key":"11452_CR15","unstructured":"M. Borowski, M. Lesniewicz, Modern usage of old one-time pad, IEEE: Military Communications and Information Systems Conference, pp. 1\u20135, 2012"},{"key":"11452_CR16","unstructured":"A. E. Omolara, A. Jantan, O. I. Abiodun, H. Arshad, An Enhanced Practical Difficulty of One-Time Pad Algorithm Resolving the Key Management and Distribution Problem, Proceedings of the International Multi Conference of Engineers and Computer Scientists, Vol. 1, 2018"},{"key":"11452_CR17","doi-asserted-by":"crossref","unstructured":"G. Upadhyay, M. J. Nene, One time pad generation using quantum superposition states, Proceedings of the IEEE International Conference on Recent Trends in Electronics, Information and Communication Technology, Bangalore, India, 20\u201321 May 2016; pp. 1882\u20131886.","DOI":"10.1109\/RTEICT.2016.7808162"},{"key":"11452_CR18","unstructured":"[18] E. Mendrofa, E. Y. Purba, B. Y. Siahaan, R. W. Sembiring, Manipulation Vigenere Cipher Algorithm With Vernam Cipher Trough Matrix Table Rotation,"},{"issue":"4","key":"11452_CR19","first-page":"368","volume":"13","author":"K Marton","year":"2012","unstructured":"Marton, K., Sucio, A., Sacarea, C., & Cret, O. (2012). Generation and testing of random numbers for cryptographic applications. Proceedings of Romanian Academy, Series-A, 13(4), 368\u2013377.","journal-title":"Proceedings of Romanian Academy, Series-A"},{"key":"11452_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.biosystems.2017.07.002","volume":"159","author":"Y Zhang","year":"2017","unstructured":"Zhang, Y., Liu, X., & Sun, M. (2017). DNA based Random Key Generation Management for OTP Encryption. Bio Systems, 159, 51\u201363.","journal-title":"Bio Systems"},{"key":"11452_CR21","doi-asserted-by":"crossref","unstructured":"N. F. Johnson, Exploring Steganography: Seeing the Unseen, IEEE Computer, Vol. 31, No. 2, 1998","DOI":"10.1109\/MC.1998.4655281"},{"key":"11452_CR22","first-page":"681","volume-title":"An Improvement in Key Domain Maximization Technique by Entropy Maximization","author":"N Uniyal","year":"2021","unstructured":"Uniyal, N., Dobhal, G., & Kothiyal, A. D. (2021). An Improvement in Key Domain Maximization Technique by Entropy Maximization (pp. 681\u2013687). Algorithms for Intelligent Systems."},{"issue":"5","key":"11452_CR23","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1007\/s11277-021-08295-5","volume":"119","author":"N Uniyal","year":"2021","unstructured":"Uniyal, N., Dobhal, G., Rawat, A., & Sikander, A. (2021). A novel encryption approach based on Vigen e re cipher for secure data communication. Wireless Personal Communications, 119(5), 1577\u20131587.","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"11452_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S0218213004001417","volume":"13","author":"R Morelli","year":"2004","unstructured":"Morelli, R., Walde, R., & Servos, W. (2004). A study of heuristic approaches for breaking short cryptograms. International Journal on Artificial Intelligence Tools, 13(1), 45\u201364.","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"4","key":"11452_CR25","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1080\/0161-119491882928","volume":"18","author":"JC King","year":"1994","unstructured":"King, J. C. (1994). An algorithm for the complete automated cryptanalysis of periodic polyalphabetic substitution ciphers. Cryptologia, 18(4), 332\u2013355.","journal-title":"Cryptologia"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-024-11452-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-024-11452-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-024-11452-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T04:28:48Z","timestamp":1723004928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-024-11452-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,15]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["11452"],"URL":"https:\/\/doi.org\/10.1007\/s11277-024-11452-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1992239\/v1","asserted-by":"object"}]},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,15]]},"assertion":[{"value":"30 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"NA.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability"}}]}}