Modification and optimization of miller – rabin simplicity test algorithm implemented by parallel computation

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.