HIGH SPEED UNIVERSAL HASHING BASED ON MANY STREAM COMPUTING

Authors

  • Євген Володимирович Котух Kharkiv National University of Radio Electronics
  • Володимир Михайлович Карташов Kharkiv National University of Radio Electronics
  • Денис Петрович Цапко Kharkiv National University of Radio Electronics
  • Олег Геннадійович Халімов Kharkiv National University of Radio Electronics
  • Аліна Вадимівна Самойлова Kharkiv National University of Radio Electronics

DOI:

https://doi.org/10.18372/2410-7840.17.8806

Keywords:

universal hashing, a lot of stream computing architecture massively parallel computing CUDA.

Abstract

Universal hashing determines provably resistantauthentication with the meter, provides high resistance tocollisions and computing speed. One of the mostpromising areas in addressing the challenges of highspeedcomputing is the use of technology GPGPU(General-purpose graphics processing units). GPGPUtechnology enables one solver to achieve a high level ofparallelism without the time-consuming data transfer andsynchronization between the nodes of the calculationresults. To enhance the universal hash-based scalarpolynomial computations and developed proposals for alot of stream computing, calculations in modulararithmetic and arithmetic over the extended finite fieldwith GPGPU technology.

Author Biographies

Євген Володимирович Котух, Kharkiv National University of Radio Electronics

postgraduate student,Department ofInformation Technology Security, Kharkiv National University of Radio Electronics.

Володимир Михайлович Карташов, Kharkiv National University of Radio Electronics

Doctor of Engineering, Head of electronic systems department, Kharkiv National University of Radio Electronics.

Денис Петрович Цапко, Kharkiv National University of Radio Electronics

postgraduate student,Department of Information Technology Security, Kharkiv National University of Radio Electronics.

Олег Геннадійович Халімов, Kharkiv National University of Radio Electronics

postgraduate student,Department of Information Technology Security, Kharkiv National University of Radio Electronics.

Аліна Вадимівна Самойлова, Kharkiv National University of Radio Electronics

postgraduate student, Department of Information Technology Security, Kharkiv National University of Radio Electronics.

References

Бабенко Л.К. Ускорение вычислений дискретного логарифма с помощью технологии CUDA./Л.К.Бабенко, И.Д. Сидоров, А.С. Кириллов //Материалы ХI Международной научнопрактической конференции «Информационная безопасность». Ч.3.Таганрог: Изд-во ТТИ ЮФУ,-2010. -С. 58-63.

Красилов А. А. Использование технологии CUDA для неграфических вычислений на GPU / А.А.Красилов // Информационные технологии

и системы 2013 (ИТС 2013) : материалы международной научной конференции, БГУИР, Минск, Беларусь, 23 октября 2013.– С. 276-277.

Lei Xu. ECDLP on GPU. [Электронный ресурс] / Lei Xu, Dongdai Lin, Jing Zou //IACR CryptologyePrint Archive -2011, Р-146.

Буркатовская Ю.Б.. Быстродействующие алгоритмы деления полиномов в арифметике по модулю два/ Ю.Б.Буркатовская, А.Н.Мальчуков, А.Н.Осокин //Известия Томского политехнического университета, 2006. - Т.309. - № 1. - С. 19-24.

Lee V. W. et al. Debunking the 100X GPU vs. CPUmyth: an evaluation of throughput computing on CPU and GPU //ACM SIGARCH Computer Architecture News. – ACM, -2010. – Т. 38. – №. 3. – С. 451-460.

Булавинцев В. Г.. О GPU реализации ограниченной версии нехронологического алгоритма DPLL / В. Г.Булавинцев, А.А Семенов // ПДМ. Приложение - 2013. -Вып. 6. –С. 111–112.

Результаты представленные на электронном ресурсе для вычислений с использованием CUDA [Эл. ресурс] http://hashcat. Net /hashcat/

Marc Stevens. New collision attacks on SHA-1 based on optimal joint local-collision analysis / Marc Stevens // EUROCRYPT 2013, Lecture Notes in Computer Science, vol. 7881, Springer, -2013. - Р. 245-261.

P. Morawiecki./Parallel authenticated encryption with the duplex construction [Электронный ресурс] // P. Morawiecki, J. Pieprzyk, Cryptology ePrint Archive: Report 2013/658.

Carter J. L. Universal classes of hash functions / J. L.Carter, M.N.Wegman // Journal of Computer and Systems Science. -1979. - V.18. -P.143-154

Bierbrauer J. On families of hash functions via geometric codes and concatenation. / J.Bierbrauer, T.Johansson, G.Kabatianskii, B.Smeets //Advances in Cryptology-CRYPTO ’93 Proceedings, Springer -Verlag.-1994.- P. 331-342.

Carter J. L. Universal classes of hash functions /J.L.Carter, M.N.Wegman // Journal of Computer and Systems Science. -1979. - V.18. -P.143-154.

Wegman. M. N. New hash functions and their use in authentication and set equality / M.N.Wegman, J.L.Carter // Journal of Computer and Systems Science.– 1981. – V. 22. – Р. 265–279.

Беспалов Д. В. Использование графических ускорителей в решении задач криптоанализа / Д.В.Беспалов, В.Г.Булавинцев, А.А Семенов //

Прикладная дискретная математика. Приложение. - 2010. -№ 3. -С. 86–87.

Желтов С.А. Некоторые оценки эффективности параллельных вычислений в архитектуре CUDA при решении задачи факторизации целых чисел / С.А.Желтов // Тр. IV Mеждунар. конгресса по интеллект. системам и информ. технол. // ХII Междунар. научн.-техн. конф. «Интеллектуальные системы» (AIS'12). – М.: Физматлит, -2012. – Т. 2. – С.191-196.

Халимов Г.З. Универсальное хеширование по максимальным кривым Гурвица / Г.З. Халимов // Журнал “Прикладная радиоэлектроника”. Харьков: ХНУРЭ. - 2010. - Т.9. -№ 3. - С.365-370.

Downloads

Published

2015-06-08

Issue

Vol. 17 No. 2 (2015)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).