Open AccessModification and optimization of miller – rabin simplicity test algorithm implemented by parallel computation
Author(s) -
Larissa V. Cherckesova,
Olga Safaryan,
Irina Trubchik,
Vladislav Chumakov,
Vasiliy I. Yukhnov,
Irina Yengibaryan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1001/1/012064
Subject(s) - simplicity , computer science , computation , algorithm , encryption , dynamic programming , simple (philosophy) , parallel computing , philosophy , epistemology , operating system
The project of modification and optimization Miller–Rabin’s simplicity test algorithm implemented by parallel computation in the programming language C# is presented, which works faster on comparison with standard iterative algorithm by 50%, which makes it easier to create the keys for such well–known encryption algorithms as RSA, DSA, etc. These methods are similar on their functionality, but have a different estimation of structural complexity that has been shown various tests. Proceeding from it, modified by authors Miller–Rabin’s algorithm realized through parallel calculations is more reliably and faster, than the standard algorithm, that is experimentally confirmed in practice.