Substantiation of correctness and advantages of Lenstra factorization method on Edwards curves
The factorization problem, which is the basis for many classical asymmetric cryptosystems (RSA, Rabin, and others) and a cryptographically strong generator of pseudo-random sequences (PBS), has been investigated in this paper. The methods that served as prototypes for the Lenstra method were describ...
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/151090 |