TESTING OF PARALLEL CRYPTOGRAPHIC ALGORITHMS

Authors

DOI:

https://doi.org/10.20397/2177-6652/2022.v22i0.2374

Abstract

The article considered the algorithms of the constituent primitive operations of asymmetric algorithms for cryptographic data transformation, which can be implemented in parallel computing systems (FPGA, GPGPU, quantum computers etc.) to accelerate cryptographic transformations. As a basis for the implementation of cryptographic primitives, it is proposed to use non-positional number systems. In particular, the article considered the residual number system and proposes two new - frequency and coordinate number systems, based on Fourier and Tom-Cook interpolation bijective mappings over a ring of integers, as well as the implementation of addition, multiplication and division with a remainder in these systems for the implementation of modular arithmetic at finite algebraic structures. The analysis of the computational and spatial complexity of cryptographic algorithms in suggested number systems is presented. As a result, the advantages of non-positional number systems are shown in the implementation of asymmetric algorithms for asymmetric cryptographic data transformation in parallel computing systems.

References

Albrecht, M. B. (2016). A subfield lattice attack on overstretched NTRU assumptions. CRYPTO, 9814, 153-178. doi:https://doi.org/10.1007/978-3-662-53018-4_6

Bajard , J., & Imbert, I. (2004). A full RNS implementation of RSA. IEEE Transactions on Computers, 769-774.

Bi, S. &. (2008). The mixed-radix Chinese remainder theorem and its applications to residue comparison. IEEE Transactions on Computers, 1624-1632.

Divesh, A. (n.d.). Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). doi:https://doi.org/10.1137/1.9781611976465.145

EMVCo. (2011, November 29). Book 2: Security and Key Management. Version 4.3. Integrated Circuit Card Specifications for Payment Systems.

Farber, R. (2011). CUDA Application Design and Development. Burlington: Elsevier Science.

Fürer, M. (2007). Faster Integer Multiplication. Proceedings of the 39th annual ACM Symposium on Theory of Computing (STOC), 55-67.

Hartwig, M. (2016). ECDSA Security in Bitcoin and Ethereum: a Research Survey. CoinFabrik, 50.

Jha, A. C. (2020). Positional Number System. NUTA Journal, 1-9.

Kaltofen, E. L. (2000). Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. Proceedings of the 2000 international symposium on Symbolic and algebraic computation, 192-201.

Katz, J. (2014). Introduction to modern cryptography: principles and protocols (2 ed.). Chapman and Hall.

Knuth, D. (1997). The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition. Addison-Wesley, 65–66, 208–209, and 290.

Lyubomudrov, A. A. (2014). The method for converting numbers represented in a positional number system into the residue number system. Vestnik Natsional'nogo Issledovatel'skogo Yadernogo Universiteta MIFI, 252-253.

Salamat, S. (2021). Fast and Energy Efficient Big Data Processing on FPGAs. UC San Diego Electronic Theses and Dissertations.

Shi, X. (2015). A novel memristive electronic synapse-based Hermite chaotic neural network with application in cryptography. Neurocomputing 166, 487-495.

Shirbhate, R. P. (2015). Design of parallel FFT architecture using Cooley Tukey algorithm. International Conference on Communications and Signal Processing (ICCSP) , 574-578.

Srivastava, V. (2021). Cryptanalysis of LRainbow: The Lifted Rainbow Signature Scheme. Provable and Practical Security. doi:https://doi.org/10.1007/978-3-030-90402-9_16

Thiel, C. a. (2021). Quantum Computer Resistant Cryptographic Methods and Their Suitability for Long-Term Preservation of Evidential Value. BLED. Retrieved from https://aisel.aisnet.org/bled2021/30

Valueva, M. (2020). Application of the residue number system to reduce hardware costs of the convolutional neural network implementation. Mathematics and Computers in Simulation, 177, 232-243. doi:https://doi.org/10.1016/j.matcom.2020.04.031.

Downloads

Published

2022-07-22

How to Cite

Bildziuk, D., Mikhaylov, D., & Shazhaev, I. (2022). TESTING OF PARALLEL CRYPTOGRAPHIC ALGORITHMS. Journal of Management & Technology, 22, 73–101. https://doi.org/10.20397/2177-6652/2022.v22i0.2374

Issue

Vol. 22 (2022): Journal of Management & Technology, Special Edition

Section

ARTIGO

License

Copyright (c) 2022 Journal of Management & Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Authors who publish with this journal agree to the following terms: • 1. The author(s) authorize the publication of the article in the journal. • 2. The author(s) ensure that the contribution is original and unpublished and is not being evaluated in other journal(s). • 3. The journal is not responsible for the opinions, ideas and concepts expressed in the texts because they are the sole responsibility of the author(s). • 4. The publishers reserve the right to make adjustments and textual adaptation to the norms of APA. • 5. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication 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. • 6. 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. • 7. 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) at http://opcit.eprints.org/oacitation-biblio.html