tuzsutТруды учебных заведений связиProceedings of Telecommunication Universities1813-324X2712-8830СПбГУТ10.31854/1813-324X-2021-7-4-119-127tuzsut-218Research ArticleТРУДЫ МОЛОДЫХ УЧЕНЫХYOUNG SCHOLARS RESEARCHБезопасная передача информации при помощи двух методов бесключевой криптографииSecure Information Transfer Using Two Keyless Cryptography Methodshttps://orcid.org/0000-0002-9174-531XГерасимовичА. С.GerasimovichA.

аспирант кафедры защищенных систем связи Санкт-Петербургского государственного университета телекоммуникаций им. проф. М.А. Бонч-Бруевича

Санкт-Петербург, 193232, Российская Федерация

St. Petersburg, 193232, Russian Federation

Alexgera93@gmail.comСанкт-Петербургский государственный университет телекоммуникаций им. проф. М.А. Бонч-БруевичаРоссияThe Bonch-Bruevich Saint-Petersburg State University of TelecommunicationsRussian Federation20212912202174119127Copyright © Герасимович А.С., 20212021Герасимович А.С.Gerasimovich A.This work is licensed under a Creative Commons Attribution 4.0 License.https://tuzs.sut.ru/jour/article/view/218

В статье рассматриваются два протокола обеспечения информационной безопасности, использующие свойства каналов связи между пользователями. Первый из них основан на известном протоколе передачи конфиденциальных сообщений Шамира. Доказывается, что в нем может быть реализована криптосистема РША, но неприменимы такие криптосистемы, как Рабина, Мак-Элис, на решетках и потоковые шифры. Основное содержание статьи посвящено описанию второго протокола распределения ключей по постоянному и бесшумному каналу связи (типа Интернет). Доказано, что он может обеспечить высокую надежность распределения ключей и требуемый уровень их секретности в терминах Шенноновской информации, причем при отсутствии каких-либо дополнительных требований к каналам связи и безо всяких криптографических предположений.

In the current paper, some methods of information security protocols based on physical layer security are considered. It is proved that well known Shamir’s protocol can be applied to RSA cryptosystem but not to Rabin, Mac-Ellice and trellis based cryptosystems.

The main stream of this paper is a description of key sharing protocol on constant public and noiseless channels (like Internet). It is shown that it is able to provide a high reliability and control of security in terms of Shannon’s information providing nothing-additional requirements to communication channels and without any cryptographic assumptions.

криптосистемы с открытым ключомраспределение ключейбезопасность на физическом уровнеусиление секретностиквантовые компьютерыпротоколыpublic key cryptosystemkey distributionShannon’s informationprivacy amplificationphysical layer security quantum computersАвтор выражает благодарность профессору Коржику В.И. за помощь при подготовке и обсуждении работы.ReferencesКоржик В.И., Яковлев В.А. Основы криптографии. СПб: Интермедия, 2016. 312 с.Korzhik V.I., Yakovlev V.A. Fundamentals of Cryptography. St. Petersburg: Intermediia Publ.; 2016. 312 p. (in Russ.)Diffie W., Hellman M. New directions in cryptography // IEEE Transactions on Information Theory. 1976. Vol. 22. Iss. 6. PP. 644‒654. DOI:10.1109/TIT.1976.055638Diffie W., Hellman M. New directions in cryptography. IEEE Transactions on Information Theory. 1976;22(6):644‒654. DOI:10.1109/TIT.1976.1055638Dyakonov M.I. Is Fault-Tolerant Quantum Computation Really Possible? // In Luryi S., Xu J., Zaslavsky A. Future Trends in Microelectronics. John Wiley & Sons, 2007. PP. 4‒18.Dyakonov M.I. Is Fault-Tolerant Quantum Computation Really Possible? In Luryi S., Xu J., Zaslavsky A. Future Trends in Microelectronics. John Wiley & Sons; 2007. p.4‒18.Bennett C.H., Bessette F., Brassard G., Salvail L., Smolin J. Experimental Quantum Cryptography // Journal of Cryptology. 1992. Vol. 5. PP. 3‒28.Bennett C.H., Bessette F., Brassard G., Salvail L., Smolin J. Experimental Quantum Cryptography. Journal of Cryptology. 1992;5:3‒28Mukherjee A., Fakoorian S.A.A., Huang J., Swindlehurst A.L. Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey // IEEE Communications Surveys & Tutorials. 2014. Vol. 16. Iss. 3. PP. 1550‒1573. DOI:10.1109/SURV.2014.012314.00178Mukherjee A., Fakoorian S.A.A., Huang J., Swindlehurst A.L. Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey. IEEE Communications Surveys & Tutorials. 2014;16(3):1550‒1573. DOI:10.1109/SURV.2014.012314.00178Schneier B. Applied Cryptography. Montreal: JW Publ. Inc., 1994.Schneier B. Applied Cryptography. Montreal: JW Publ. Inc.; 1994Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. Boca Raton: CRC Press, 1997. DOI:10.1201/9780429466335Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. Boca Raton: CRC Press; 1997. DOI:10.1201/9780429466335Shor P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer // Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Santa Fe, USA, 20–22 November 1994). IEEE Computer Society Press, 1994. PP. 124–134.Shor P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 20–22 November 1994, Santa Fe, USA. IEEE Computer Society Press; 1994. p.124–134.Goldreich O., Goldwasser S., Halevi S. Public–key cryptography from lattice reduction problems // Proceedings of the 17th Annual International Cryptology Conference (Santa Barbara, USA, 17–21 August 1997). Lecture Notes in Computer Science. Vol. 1291. Berlin, Heidelberg: Springer, 1997. PP. 112‒131. DOI:10.1007/BFb0052231Goldreich O., Goldwasser S., Halevi S. Public–key cryptography from lattice reduction problems. Proceedings of the 17th Annual International Cryptology Conference, 17–21 August 1997, Santa Barbara, USA. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. vol.1291. p.112‒131. DOI:10.1007/BFb0052231Alpern B., Schneider F.B. Key exchange using ‘keyless cryptography’ // Information Processing Letters. 1983. Vol. 16. Iss. 2. PP. 79‒81. DOI:10.1016/0020-0190(83)90029-7Alpern B., Schneider F.B. Key exchange using ‘keyless cryptography’. Information Processing Letters. 1983;16(2):79‒81. DOI:10.1016/0020-0190(83)90029-7Maurer U.M. Secrete key agreement by public discussion from common information // IEEE Transactions on Information Theory. 1993. Vol. 39. Iss. 3. PP. 733‒742. DOI:10.1109/18.256484Maurer U.M. Secrete key agreement by public discussion from common information. IEEE Transactions on Information Theory. 1993;39(3):733‒742. DOI:10.1109/18.256484Yakovlev V., Korzhik V., Morales-Luna G. Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions with Parameter Optimization // IEEE Transactions on Information Theory. 2008. Vol. 54. Iss. 6. PP. 2535‒2549. DOI:10.1109/TIT.2008.921689Yakovlev V., Korzhik V., Morales-Luna G. Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions with Parameter Optimization. IEEE Transactions on Information Theory. 2008;54(6):2535‒2549. DOI:10.1109/TIT.2008.921689Korzhik V., Starostin V., Kabardov M., Gerasimovich A., Yakovlev V., Zhuvikin A. Protocol of key distribution over public noiseless channels executing without cryptographic assumptions // International Journal of Computer Science and Application. 2020. Vol. 17. Iss. 1. PP. 1‒14.Korzhik V., Starostin V., Kabardov M., Gerasimovich A., Yakovlev V., Zhuvikin A. Protocol of key distribution over public noiseless channels executing without cryptographic assumptions. International Journal of Computer Science and Application. 2020;17(1):1‒14.Korzhik V., Starostin V., Kabardov M., Gerasimovich A., Yakovlev V., Zhuvikin A. Optimization of the Key Sharing Protocol for Noiseless Public Channels without the Use of Cryptographic Assumptions // Proceedings of the 44th International Convention on Information, Communication and Electronic Technology (MIPRO, Opatija, Croatia, 27 September‒1 October 2021). IEEE, 2021. PP. 1202‒1207. DOI:10.23919/MIPRO52101.2021.9596703Korzhik V., Starostin V., Kabardov M., Gerasimovich A., Yakovlev V., Zhuvikin A. Optimization of the Key Sharing Protocol for Noiseless Public Channels without the Use of Cryptographic Assumptions. Proceedings of the 44th International Convention on Information, Communication and Electronic Technology, MIPRO, 27 September‒1 October 2021, Opatija, Croatia. IEEE; 2021. p.1202‒1207. DOI:10.23919/MIPRO52101.2021.9596703Korzhik V.I., Starostin V.S., Kabardov M.M., Gerasimovich A.M., Yakovlev V.A., Zhuvikin A.G. Information theoretically secure key sharing protocol executing with constant noiseless public channels // Matematicheskie Voprosy Kriptografii. 2021. Vol. 12. Iss. 3. PP. 125–141. DOI:10.4213/mvk378Korzhik V.I., Starostin V.S., Kabardov M.M., Gerasimovich A.M., Yakovlev V.A., Zhuvikin A.G. Information theoretically secure key sharing protocol executing with constant noiseless public channels. Matematicheskie Voprosy Kriptografii. 2021;12(3):125–141. DOI:10.4213/mvk378MacKay D.J.C., Neal R.M. Near Shannon Limit Performance of Low Density Parity Check Codes // Electronics Letters. 1997. Vol. 33. Iss. 18. PP. 457–458.MacKay D.J.C., Neal R.M. Near Shannon Limit Performance of Low Density Parity Check Codes. Electronics Letters. 1997;33(18):457–458.Fossorier M. P.C., Mihaljevic M., Imai H. Reduced complexity iterative decoding of low density parity check codes based on belief propagation // IEEE Transactions on Communications 1999. Vol. 47. Iss. 5. PP. 673‒680. DOI:10.1109/26.768759Fossorier M. P.C., Mihaljevic M., Imai H. Reduced complexity iterative decoding of low density parity check codes based on belief propagation. IEEE Transactions on Communications. 1999;47(5):673‒680. DOI:10.1109/26.768759Korjik V., Morales-Luna G., Balakirsky V.B. Privacy Amplfication Theorem for Noisy Main Channel // Proceedings of the 4th International Conference on Information Security (ISC 2001, Malaga, Spain, 1–3 October 2001). Lecture Notes in Computer Science. Vol. 2200. Berlin, Heidelberg: Springer, 2001. PP. 18‒26. DOI:10.1007/3-540-45439-X_2Korjik V., Morales-Luna G., Balakirsky V.B. Privacy Amplfication Theorem for Noisy Main Channel. Proceedings of the 4th International Conference on Information Security, ISC 2001, 1–3 October 2001, Malaga, Spain. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2001. vol.2200. p.18‒26. DOI:10.1007/3-540-45439-X_2Подорожный И.В. Обзор аппаратных генераторов случайных чисел // Молодой ученый. 2015. № 1(105). URL: http://moluch.ru/archive/105/24688 (дата обращения 24.06.2020)Podorozhnyi I. V. Overview of Hardware Random Number Generators. Molodoy uchenyi. 2015;1(105). Available from: http://moluch.ru/archive/105/24688 [Accessed 24th June 2020] (In Rus.)Needham R.M., Schroeder M.D. Using encryption for authentication in large network of computers // Communications of the ACM. 1978. Vol. 21. Iss. 12. PP. 993‒999. DOI:10.1145/359657.359659Needham R.M., Schroeder M.D. Using encryption for authentication in large network of computers. Communications of the ACM. 1978;21(12):993‒999. DOI:10.1145/359657.359659Jin R., Shi L., Zeng K., Pande A., Mohapatra P. MagPairing: Pairing Smartphones in Close Proximity Using Magnetometer // IEEE Transactions on Information Forensics and Security. 2016. Vol. 11. Iss. 6. PP. 1306‒1320. DOI:10.1109/TIFS.2015.2505626Jin R., Shi L., Zeng K., Pande A., Mohapatra P. MagPairing: Pairing Smartphones in Close Proximity Using Magnetometer // IEEE Transactions on Information Forensics and Security. 2016. Vol. 11. Iss. 6. PP. 1306‒1320. DOI:10.1109/TIFS.2015.2505626

The authors declare that there are no conflicts of interest present.