Application of the basic module's foundation for factorization of big numbers by the Fеrmаt method
The Fermat method is considered to be the best for factorization of numbers N=p×q in case of close p and q. Computational complexity of the basic algorithm of the method is determined by the number of check values of X when solving equation Y2=X2‑N, as well as by complexity of the arithmetic operati...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PC Technology Center
2018-12-01
|
| Series: | Eastern-European Journal of Enterprise Technologies |
| Subjects: | |
| Online Access: | http://journals.uran.ua/eejet/article/view/150870 |