Test of verification of multidigit numbers on simplicity on the basis of method of vector and modular multiplication

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...

Full description

Saved in:
Bibliographic Details
Published in2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET) pp. 534 - 536
Main Authors Nikolaichuk, Yaroslav, Ivasiev, Stepan, Yakymenko, Ihor, Kasianchuk, Mykhajlo
Format Conference Proceeding
LanguageEnglish
Published National University "Lviv Polytechnic" 01.02.2016
Subjects
Algorithm of modular multiplication
Computers
Decision support systems
Miller - Rabin primality test
probabilistic tests Farm
Solovay-Strassen's test
symbol Jacobi
Online AccessGet full text
DOI10.1109/TCSET.2016.7452107

Cover

More Information
Summary: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.
DOI:10.1109/TCSET.2016.7452107