Author:
Cherckesova L,Safaryan O,Trubchik I,Chumakov V,Yukhnov V,Yengibaryan I
Abstract
Abstract
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.
Reference14 articles.
1. Improved Pollard rho method for computing discrete logarithms over finite extension fields;Wang;Journal of Computational and Applied Mathematics,2012
2. Implementation of the Miller–Rabin Algorithm in the C# Programming Language;Galov;Molodoj Issledovatel Dona,2019
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Algorithm for Optimizing the Composition of Transport Security Units Using Interval Graphs;Fundamental and Applied Scientific Research in the Development of Agriculture in the Far East (AFE-2022);2023
2. Set-Theoretic Operations and Transport Security;Fundamental and Applied Scientific Research in the Development of Agriculture in the Far East (AFE-2022);2023
3. Optimization of Cargo Transportation Resource Allocation Based on Lean Manufacturing;Lecture Notes in Networks and Systems;2022-11-16