Parallelization of RSA cryptographic algorithm based on CUDA technologies

Simple item page
dc.citation.epage9
dc.citation.issue2
dc.citation.journalTitleВимірювальна техніка та метрологія
dc.citation.spage5
dc.citation.volume82
dc.contributor.affiliationLviv Polytechnic National University
dc.contributor.authorMochurad, Lesia
dc.contributor.authorKryvenchuk, Yuriy
dc.contributor.authorYatsyshyn, Svyatoslav
dc.coverage.placenameЛьвів
dc.coverage.placenameLviv
dc.date.accessioned2022-05-23T11:23:53Z
dc.date.available2022-05-23T11:23:53Z
dc.date.created2021-02-23
dc.date.issued2021-02-23
dc.description.abstractThe paper examines the efficiency of the application of CUDA technologies for the parallelization of the cryptographic algorithm with the public key. The speed of execution of several implementations of the algorithm is compared: sequential implementation on the CPU and two parallel implementations – on the CPU and GPU. A description of the public key algorithm is presented, as well as properties that allow it to be parallelized. The advantages and disadvantages of parallel implementations are analyzed. It is shown that each of them can be suitable for different scenarios. The software was developed and several numerical experiments were performed. The reliability of the obtained results of encryption and decryption is confirmed. To eliminate the influence of external factors at the time of execution the algorithm was tested ten times in a row and the average value was calculated. Acceleration coefficients for message encryption and decryption algorithms were estimated based on OpenMP and CUDA technology. The proposed approach focuses on the possibility of further optimization through the prospects of developing a multi-core architecture of computer systems and graphic processors.
dc.format.extent5-9
dc.format.pages5
dc.identifier.citationMochurad L. Parallelization of RSA cryptographic algorithm based on CUDA technologies / Lesia Mochurad, Yuriy Kryvenchuk, Svyatoslav Yatsyshyn // Measuring equipment and metrology. — Lviv : Lviv Politechnic Publishing House, 2021. — Vol 82. — No 2. — P. 5–9.
dc.identifier.citationenMochurad L. Parallelization of RSA cryptographic algorithm based on CUDA technologies / Lesia Mochurad, Yuriy Kryvenchuk, Svyatoslav Yatsyshyn // Measuring equipment and metrology. — Lviv : Lviv Politechnic Publishing House, 2021. — Vol 82. — No 2. — P. 5–9.
dc.identifier.doihttps://doi.org/10.23939/istcmtm2021.02.005
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/56826
dc.language.isoen
dc.publisherВидавництво Львівської політехніки
dc.publisherLviv Politechnic Publishing House
dc.relation.ispartofВимірювальна техніка та метрологія, 2 (82), 2021
dc.relation.ispartofMeasuring equipment and metrology, 2 (82), 2021
dc.relation.references[1] H. Sutter, “The free lunch is over: A Fundamental Turn Toward Concurrency in Software”, Dr. Dobb’s Journal, vol. 30, no. 3, p.7, 2005.
dc.relation.references[2] M. Balandin, E. Shurina, “The Methods for Solving High-dimensional SLAE”, NSTU, pp. 28–35, 2000.
dc.relation.references[3] B. Chapman, G. Jost, “Ruud van der Pas: Using OpenMP: portable shared memory parallel programming”, Sc. and Eng. Comp., Cambridge, pp. 164–172, 2008.
dc.relation.references[4] L. Mochurad, N. Boyko, V.Sheketa, “Parallelization of the Process of Calculating the Optimal Route for a Strike Aircraft Flight”, Proc. of 2nd Int. Workshop on Control, pp. 63–75, 2020.
dc.relation.references[5] C. Yang, C. Huang, C. Lin, “Hybrid CUDA, OpenMP, and MPI parallel programming on multicore GPU clusters”, Comp. phys. com., vol. 1, pp. 266–269, 2011.
dc.relation.references[6] A. Grama, A. Gupta, G. Karypis, V. Kumar, “Introduction to Parallel Computing”, Addison Wesley, p. 856, 2003.
dc.relation.references[7] L. Mochurad, N. Boyko, “Technologies of distributed systems and parallel computation:”, Publ. House “Bona”, 2020.
dc.relation.references[8] R. Farber, “CUDA Application Design and Development”, Morgan Kaufmann, p. 336, 2011.
dc.relation.references[9] J. Sanders, E. Kandrot, “CUDA by Example: An Introduction to General Purpose GPU Programming”, Addison-Wesley Professional, p. 312, 2010.
dc.relation.references[10] S. Barychev, V. Honcharov, R. Serov, “Fundamentals of Modern Cryptography: A Textbook”, RF: Hot Line, 2002.
dc.relation.references[11] A. Metolkin, V. Kardashuk, “Studies of the Methods of enhancing the cryptographic stability”, Bull East-Ukr. University named after V. Dal, vol. 6, pp. 90–95, 2018 (in Ukr.).
dc.relation.references[12] Official page of CUDA technologies, 2020. [Online]. Available: https://developer.nvidia.com/cuda-zone.
dc.relation.references[13] O. Klochko, E. Kovalenko, “RSA Data encryption algorithm”, J.: Science, technics and education, vol 3, pp. 1–11, 2016.
dc.relation.references[14] S. Prasanth, K. Jegadish, B. Partibane, “Efficient Modular Exponentiation Architectures for RSA Algorithm”, Int. J. Eng. Res. in Electronic and Com. Eng., vol. 3, no. 5, pp. 230–234, 2016.
dc.relation.references[15] S. Saxena, B. Kapoor, “State of the Art Parallel Approaches for RSA Public Key Based Cryptosystem”, Int. J. on Comp. Sc. & Appl. (IJCSA), Vol. 5, No. 1, Febr. 2015.
dc.relation.references[16] D. Chang, M. Kantardzic, M. Ouyang, “Hierarchical Clustering with CUDA/GPU”, ISCA PDCCS, pp. 7–12, 2009.
dc.relation.references[17] L. Mochurad, N. Boyko, N. Stanasiuk, “Forecasting stock prices and accounting for stock market on multicore computers”, Int. Workshop on Conflict Man. in Glob. Inf. Networks, pp. 276–289, 2019.
dc.relation.referencesen[1] H. Sutter, "The free lunch is over: A Fundamental Turn Toward Concurrency in Software", Dr. Dobb’s Journal, vol. 30, no. 3, p.7, 2005.
dc.relation.referencesen[2] M. Balandin, E. Shurina, "The Methods for Solving High-dimensional SLAE", NSTU, pp. 28–35, 2000.
dc.relation.referencesen[3] B. Chapman, G. Jost, "Ruud van der Pas: Using OpenMP: portable shared memory parallel programming", Sc. and Eng. Comp., Cambridge, pp. 164–172, 2008.
dc.relation.referencesen[4] L. Mochurad, N. Boyko, V.Sheketa, "Parallelization of the Process of Calculating the Optimal Route for a Strike Aircraft Flight", Proc. of 2nd Int. Workshop on Control, pp. 63–75, 2020.
dc.relation.referencesen[5] C. Yang, C. Huang, C. Lin, "Hybrid CUDA, OpenMP, and MPI parallel programming on multicore GPU clusters", Comp. phys. com., vol. 1, pp. 266–269, 2011.
dc.relation.referencesen[6] A. Grama, A. Gupta, G. Karypis, V. Kumar, "Introduction to Parallel Computing", Addison Wesley, p. 856, 2003.
dc.relation.referencesen[7] L. Mochurad, N. Boyko, "Technologies of distributed systems and parallel computation:", Publ. House "Bona", 2020.
dc.relation.referencesen[8] R. Farber, "CUDA Application Design and Development", Morgan Kaufmann, p. 336, 2011.
dc.relation.referencesen[9] J. Sanders, E. Kandrot, "CUDA by Example: An Introduction to General Purpose GPU Programming", Addison-Wesley Professional, p. 312, 2010.
dc.relation.referencesen[10] S. Barychev, V. Honcharov, R. Serov, "Fundamentals of Modern Cryptography: A Textbook", RF: Hot Line, 2002.
dc.relation.referencesen[11] A. Metolkin, V. Kardashuk, "Studies of the Methods of enhancing the cryptographic stability", Bull East-Ukr. University named after V. Dal, vol. 6, pp. 90–95, 2018 (in Ukr.).
dc.relation.referencesen[12] Official page of CUDA technologies, 2020. [Online]. Available: https://developer.nvidia.com/cuda-zone.
dc.relation.referencesen[13] O. Klochko, E. Kovalenko, "RSA Data encryption algorithm", J., Science, technics and education, vol 3, pp. 1–11, 2016.
dc.relation.referencesen[14] S. Prasanth, K. Jegadish, B. Partibane, "Efficient Modular Exponentiation Architectures for RSA Algorithm", Int. J. Eng. Res. in Electronic and Com. Eng., vol. 3, no. 5, pp. 230–234, 2016.
dc.relation.referencesen[15] S. Saxena, B. Kapoor, "State of the Art Parallel Approaches for RSA Public Key Based Cryptosystem", Int. J. on Comp. Sc. & Appl. (IJCSA), Vol. 5, No. 1, Febr. 2015.
dc.relation.referencesen[16] D. Chang, M. Kantardzic, M. Ouyang, "Hierarchical Clustering with CUDA/GPU", ISCA PDCCS, pp. 7–12, 2009.
dc.relation.referencesen[17] L. Mochurad, N. Boyko, N. Stanasiuk, "Forecasting stock prices and accounting for stock market on multicore computers", Int. Workshop on Conflict Man. in Glob. Inf. Networks, pp. 276–289, 2019.
dc.relation.urihttps://developer.nvidia.com/cuda-zone
dc.rights.holder© Національний університет “Львівська політехніка”, 2021
dc.subjectThe public key algorithm
dc.subjectGraphics processor
dc.subjectEfficiency indicator
dc.subjectOpenMP standard
dc.titleParallelization of RSA cryptographic algorithm based on CUDA technologies
dc.typeArticle

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
2021v82n2_Mochurad_L-Parallelization_of_RSA_cryptographic_5-9.pdf
Size:
216.48 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
2021v82n2_Mochurad_L-Parallelization_of_RSA_cryptographic_5-9__COVER.png
Size:
1.45 MB
Format:
Portable Network Graphics
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.8 KB
Format:
Plain Text
Description:
Download

Collections

Вимірювальна техніка та метрологія. – 2021. – Випуск 82, №2