DOI
10.34229/KCA2522-9664.25.4.4
UDC 621.391:519.2:519.7
1 Institute of Physics and Technology of the National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute;" National Bank of Ukraine, Kyiv, Ukraine
 pplayshner@gmail.com
|
2 Institute of Physics and Technology of the National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute," Kyiv, Ukraine
mmzi.cat@gmail.com
|
3 Institute of Physics and Technology of the National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute," Kyiv, Ukraine
the.vaho1337@gmail.com
|
|
Application of the general theory of optimal algorithms in cryptography,
steganography, and blockchain technology
Abstract. Analysis and synthesis of one-way and trapdoor functions are the basis for security estimates and the construction of cryptographic transformations, steganographic systems, and blockchain consensus protocols. The paper considers the information-computational approach to creating such functions based on the general theory of optimal algorithms and their applications in cryptography, steganography, and the analysis and synthesis of blockchain consensus protocols.
Keywords: a general theory of optimal algorithms, one-way function, trapdoor function, cryptosystem’s security estimates, steganography, blockchain.
full text
REFERENCES
- 1. Goldreich O. Foundations of Cryptography. Vol. 1. Basic Tools. London: Cambridge University Press, 2001. 555 pp.
- 2. Shannon C. Theory of Communication in Secret Systems. In: Shannon C. Works on Information Theory and Cybernetics. Moscow: Foreign Literature Publishing House, 1963. pp. 333–369.
- 3. Goldwasser S., Bellare M. Lecture Notes on Cryptography. Cambridge, Massachusetts, 2001. 283 pp.
- 4. Traub J., Wozniakowski H. General Theory of Optimal Algorithms. Moscow: Mir, 1983. 382 pp.
- 5. Sergienko I.V., Zadiraka V.K., Lytvyn O.M. Elements of the General Theory of Optimal Algorithms. Cham: Springer, 2021. 378 pp. https://doi.org/10.1007/978-3-030-90908-6.
- 6. Traub J., Wasilkowski G., Wozniakowski H. Information, Uncertainty, Complexity. Reading, MA: Addison-Wesley, 1983. 176 pp.
- 7. Garey M., Johnson D. Computers and Intractable Problems. Moscow: Mir, 1982. 416 pp.
- 8. Bogdanov A., Trevisan L. Average-Case Complexity. Foundations and Trends® in Theoretical Computer Science. 2006. Vol. 2, No. 1. pp. 1–106. http://dx.doi.org/10.1561/0400000004.
- 9. Goldwasser S., Micali S. Probabilistic Encryption. Journal of Computer and System Sciences. 1984. Vol. 28, No. 2. pp. 270–299. https://doi.org/10.1016/0022-0000(84)90070-9.
- 10. Dolev D., Dwork C., Naor M. Non-Malleable Cryptography. STOC’91: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing (May 5–8, 1991, New Orleans, Louisiana, USA). New York: Association for Computing Machinery, 1991. pp. 542–552. https://doi.org/10.1145/103418.103474.
- 11. Yao A.C. Theory and Application of Trapdoor Functions. 23rd Annual Symposium on Foundations of Computer Science (Chicago, IL, USA, 03–05 November 1982). IEEE, 1982. pp. 80–91. https://doi.org/10.1109/SFCS.1982.45.
- 12. Kudin A.M. Cryptographic Transformations of Non-Shannon Sources of Information. Cybernetics and Systems Analysis. 2010. Vol. 46, No. 5. pp. 813–819. https://doi.org/10.1007/s10559-010-9263-5.
- 13. Zadiraka V., Kudin A., Shvidchenko I., Bredelev B. Cryptographic and Steganographic Protocols for Cloud Systems. In: Computer Technologies in Information Security. Zadiraka V., Nykolaichuk Y. (Eds.). Ternopil, 2015. pp. 9–41.
- 14. Kudin A.M., Kovalenko B.A., Shvidchenko I.V. Blockchain Technology: Issues of Analysis and Synthesis. Cybernetics and Systems Analysis. 2019. Vol. 55, No. 3. pp. 488–495. https://doi.org/10.1007/s10559-019-00156-1.
- 15. Zapechnikov S.V. Cryptographic Protocols and Their Application in Financial and Commercial Activities. Moscow: Hot Line–Telecom, 2007. 320 pp.
- 16. Steiner M., Tsudik G., Waidner M. Diffie–Hellman Key Distribution Extended to Groups. CCS’96: Proceedings of the 3rd ACM Conference on Computer and Communications Security (14–15 March, 1996, New Delhi, India). New York: Association for Computing Machinery, 1996. pp. 31–37. https://doi.org/10.1145/238168.238182.
