Method and device to implement accumulating to arbitrary modulo in cryptographic applications

Vyacheslav Petrenko, Vladimir Kopytov, Matvey Sutormin

Abstract


This article examines the methods of accumulating in the context of operations of multiplying numbers to arbitrary modulo in cryptographic applications. The authors present a new approach to data processing using methods accumulating to arbitrary modulo, which when encrypting information will improve the performance of cryptographic transformation operations. The article describes in detail the main methods of accumulating to arbitrary modulo, their advantages and potential uses in cryptographic applications. The research, methodologies and practical solutions presented in the article are of interest to specialists in the field of cybersecurity, as well as to developers of high-tech software and IS software and hardware.

Full Text:

PDF

References


V. F. Shangin, Zashchita informacii v komp'yuternyh sistemah i setyah [Information protection in computer systems and networks]. DMK Press, 2012. 592 p. (in Russian).

S. Singh, S. K. Maakar, and S. Kumar. “A Performance Analysis of DES and RSA Cryptography.” International Journal of Emerging Trends & Technology in Computer Science, 2013, vol. 2, Issue 3, pp. 418–423.

B. Preneel, “Cryptographic hash functions,” Eur. Trans. Telecommun., vol. 5, no. 4, pp. 431–448, 1994, doi: 10.1002/ETT.4460050406.

G. J. Simmons, “A ‘weak’ privacy protocol using the rsa crypto algorithm,” Cryptologia, vol. 7, no. 2, pp. 180–182, 1983, doi: 10.1080/0161-118391857900.

A. Jung, “Implementing the RSA cryptosystem,” Comput. Secur., vol. 6, no. 4, pp. 342–350, Aug. 1987, doi: 10.1016/0167-4048(87)90070-8.

J. Gordon, “Strong RSA keys,” Electron. Lett., vol. 20, no. 12, pp. 514–516, Jun. 1984, doi: 10.1049/EL:19840357.

M. Preetha and M. Nithya, “A study and performance analysis of RSA algorithm,” IJCSMC, Vol. 2, Issue. 6, June 2013, pg.126 – 139.

Y. V. Artyukhov, Analiz algoritma RSA. Nekotorye rasprostranyonnye elementarnye ataki i mery protivodejstviya im. [Analysis of the RSA algorithm. Some common elementary attacks and countermeasures]. Young Scientist, no. 22, p. Т.1. 85-87, 2010 (in Russian).

H. Nikumbh and V. Shah, “Hardware implementation of modular multiplication,” 2018 3rd IEEE Int. Conf. Recent Trends Electron. Inf. Commun. Technol. RTEICT 2018 - Proc., pp. 376–380, May 2018, doi: 10.1109/RTEICT42901.2018.9012447.

B. V. Tarabrin, S.V. YAkubovski, N. A. Barkanov. B. V. Tarabrin, Spravochnik po integral'nym mikroskhemam. Ed. by B.V. Tarabrin. - 2nd ed., revised and enlarged - M.: Energia, 1981.

V. I. Petrenko, J. V. Kuz’minov. Nakaplivayushchij summator po modulyu [Modulo Adder-Accumulator]. Patent Russia, no. 2500017 C1. 2013 (in Russian).

V. I. Petrenko, D. D. Puiko. Nakaplivayushchij summator po modulyu [Modulo Accumulator]. Patent Russia, no. 2791441 C1. 2023 (in Russian).

R. P. Brent and H. T. Kung, “A Regular Layout for Parallel Adders,” IEEE Trans. Comput., vol. C–31, no. 3, pp. 260–264, 1982, doi: 10.1109/TC.1982.1675982.

T. Matsunaga and Y. Matsunaga, “Timing-constrained area minimization algorithm for parallel prefix adders,” IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol. E90-A, no. 12, pp. 2770–2777, 2007, doi: 10.1093/IETFEC/E90-A.12.2770.

P. Kogge and H. Stone, “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations,” IEEE Trans. Comput., vol. C–22, no. 8, pp. 786–793, 1973, doi: 10.1109/TC.1973.5009159.

C. H. Pavan Kumar and K. Sivani, “Implementation of efficient parallel prefix adders for residue number system,” Int. J. Comput. Digit. Syst., vol. 4, no. 4, pp. 295–300, Oct. 2015, doi: 10.12785/IJCDS/040409.

S. L. Harris and D. Harris, “Hardware Description Languages,” Digit. Des. Comput. Archit., pp. 170–235, 2022, doi: 10.1016/B978-0-12-820064-3.00004-0.

“Circuit Modeling with Hardware Description Languages,” Top-Down Digit. VLSI Des., pp. 179–300, 2015, doi: 10.1016/B978-0-12-800730-3.00004-6.

P. Benáček, V. Puš, H. Kubátová, and T. Čejka, “P4-To-VHDL: Automatic generation of high-speed input and output network blocks,” Microprocess. Microsyst., vol. 56, pp. 22–33, Feb. 2018, doi: 10.1016/J.MICPRO.2017.10.012.

J. Zhu and N. Dutt, “Electronic System-Level Design and High-Level Synthesis,” Electron. Des. Autom., pp. 235–297, 2009, doi: 10.1016/B978-0-12-374364-0.50012-6.

C. M. Maxfield, “‘Traditional’ Design Flows,” FPGAs: Instant Access, pp. 75–106, 2008, doi: 10.1016/B978-0-7506-8974-8.00005-3.

E.S. Balaka, D.A.Gorodecky, V.S. Rukhlov, A.N. Schelokov, Razrabotka vysokoskorostnyh summatorov po modulyu na baze kombinacionnyh summatorov s parallel'nym perenosom [Design and synthesis of high speed modulo adders using parallel prefix structure] Izvestiya SFedU. Engineering Sciences, no. 6 (179), p. 910, 2016 (in Russian).


Refbacks

  • There are currently no refbacks.


Abava  Кибербезопасность MoNeTec 2024

ISSN: 2307-8162