Logo PTI Logo FedCSIS

Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems

Annals of Computer Science and Information Systems, Volume 26

On new stream algorithms generating sensitive digests of computer files


DOI: http://dx.doi.org/10.15439/2021F80

Citation: Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems, M. Ganzha, L. Maciaszek, M. Paprzycki, D. Ślęzak (eds). ACSIS, Vol. 26, pages 117121 ()

Full text

Abstract. The paper is dedicated to construction of new fast and flexible hash-based message authentication codes (HMACs) that will provide large files with cryptographically stable digestions in the Postquantum era.  These instruments can be used for detecting cyber-terrorist attacks, file audits and checking the integrity of messages during communication, We use algebraic properties of well known extremal graphs D(n, q) and A(n,q) with good expansion property for the construction of HMACS.


  1. Oliynykov R., Gorbenko I., Kazymyrov O., Ruzhentsev V., Kuznetsov O., Gorbenko Yu., Dyrda O., Dolgov V., Pushkaryov A., Mordvinov R., Kaidalov D. Data Security. Symmetric block transformation algorithm. Ministry of Economical Development and Trade of Ukraine. DSTU 7624:2014. National Standard of Ukraine. Information technologies. Cryptographic. 2015.
  2. Aumasson J. Ph, Serious Cryptography: A Practical Introduction to Modern Encryption, No Starch Press. – 2017. – 312 pp.
  3. Pustovit O., Ustymenko V., Pro zastosuvannia alhebraichnoi kombinatoryky do problem koduvannia ta kryptohrafii [On the application of algebraic combinatorics to the problems of coding and cryptography] //Matematychne modeliuvannia v ekonomitsi, No 1-2. – Kyiv. – 2017. – s. 31-46.
  4. V. Ustimenko, U. Romanczuk-Polubiec, A. Wroblewska, M. Polak, E. Zhupa, On the constructions of new symmetric ciphers based on non- bijective multivariate maps of prescribed degree, Security and Communication Networks, 2019 . Volume 2019, Article ID 2137561, 15 pages
  5. V. Ustimenko, U. Roman’czuk-Polubiec, A. Wroblewska, M. Polak and E. Zhupa, On the implementation of new symmetric ciphers based on non-bijective multivariate maps, Proceedings of the 2018 Federated Conference on Computer Science and Informatics. Proceedings of the Federated Conference on Computer Science and Information Systems pp. 397–405 http://dx.doi.org/10.15439/2018F204 ISSN 2300-5963 ACSIS, Vol. 15, pp.397-405.
  6. Mathew Cary, Ramarathnam Venkatesam, A Message Authentication Code Based on Unimodular Matrix Groups, Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, Lecture Notes in Computer Science.
  7. Priyadarsini P.L.K., A Survey on some Applications of Graph Theory in Cryptography, Journal of Discrete Mathematical Sciences and Cryptography, 18:3, 209-217 (2015).
  8. Mihir Bellare, Daniel J. Bernstein, and Stefano Tessaro, Hash-function based PRFs:AMAC and its multi-user security, LNCS, pages 566-595. Springer, Heidelberg, 2016.
  9. Kan Yasuda. A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier. In Antoine Joux, editor, EUROCRYPT, volume 5479 of Lecture Notes in Computer Science, pages 242-259. Springer, 2009.
  10. Xiaoyun Wang, Hongbo Yu,WeiWang, Haina Zhang, and Tao Zhan. Cryptanalysis on HMAC/NMACMD5 and MD5-MAC. In Antoine Joux, editor, EUROCRYPT, volume 5479 of Lecture Notes in Computer Science, pages 121-133. Springer, 2009.
  11. Gaetan Leurent, Thomas Peyrin, and Lei Wang. New Generic Attacks against Hash-Based MACs. In Kazue Sako and Palash Sarkar, editors, Advances in Cryptology-ASIACRYPT 2013-1 volume 8270, pages 11-20. 2013.
  12. Neal Koblitz and Alfred Menezes. Another look at HMAC. Cryptology ePrint Archive, Report 2012/074, 2012.
  13. Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, and Daniel Wichs. Message authentication, revisited.In David Pointcheval and Thomas Johansson, editors, EUROCRYPT 2012, volume 7237 of LNCS, pages 355-374. Springer, Heidelberg, April 2012
  14. Yevgeniy Dodis and John P. Steinberger, Domain Extension for MACs Beyond the Birthday Barrier, In Kenneth G. Paterson, editor, EUROCRYPT, volume 6632 of Lecture Notes in Computer Science,pages 323-342. Springer, 2011.
  15. Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, and Stefano Tessaro. To Hash or Not to Hash Again? ,(In) Difererentiability Results for H2 and HMAC. In Reihaneh Safavi-Naini and Ran Canetti,editors, CRYPTO, volume 7417 of Lecture Notes in Computer Science, pages 348-366. Springer, 2012.
  16. Pierre-Alain Fouque, Gaetan Leurent, and Phong Q. Nguyen. Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5, In Alfred Menezes, editor, CRYPTO, volume 4622 of Lecture Notes in Computer Science, pages 13-30. Springer, 2007.
  17. Jongsung Kim, Alex Biryukov, Bart Preneel, and Seokhie Hong. On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract). In Roberto De Prisco and Moti Yung, editors, SCN, volume 4116 of Lecture Notes in Computer Science. Springer, 2006.
  18. Krendelev S., Sazonova P., Parametric Hash Function Resistant to Attack by Quantum Computer, Based on Problem of Solving a System of Polynomial Equations in Integers, Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS. – Vol. 15. рр. 387–390 (2018)
  19. V. A. Ustimenko, On the Families of Stable Multivariate Transformations of Large Order and Their Cryptographical Applications, Tatra Mountains Mathematical Publications,2O17, 70(1), pp 107-117.
  20. V. A. Ustimenko, On multivariate public keys based on the pair of transformations with the density gap. Доповіді НАН У, 2018. 9, с. 21-27.
  21. V.Ustimenko, On the usage of postquantum protocols defined in terms of transformation semi-groups and their homomorphisma, Theoretical and Applied Cybersecurity, National Technical University of Ukraine "Igor Sikorsky Kiev Polytechnic Institute", vol 2, 2020, pp. 32-44.