Stepan Ivasiev

Learn More
Factorization is one of the most important problems in the theory of numbers and a modern asymmetric cryptography. Known methods of factorization are quite cumbersome; therefore, require significant computational resources for processing multi-bit numbers. The relevance of the factorization problem is dictated also by uncertainty regarding the theoretical(More)
The test for checking on the simplicity of multidigit numbers with using the method of vector and modular multiplication, which is characterized by high performance and low computational complexity in comparison with known is designed in this article. The block diagram of algorithm operation and its gradually implementation is presented.
  • 1