Our Digital Library contains 1 376 digital objects
Object
Title: COMPARISON OF ALGORITHMS FOR FACTORIZATION OF LARGE NUMBERS HAVING SEVERAL DISTINCT PRIME FACTORS
Creator:
Abstract:
We present analysis of security of the most known assymetric algorythm RSA and its modern version MultiPrime RSA. We focused on more precisious estimations of time complexity of two factorization algorithms: Elliptic Curve Method and General Number Field Sieve. Additionally for the MultiPrime RSA algorithm we computed the maximal number of prime factors for given modulus length which does not decrease the security level.
Date issued:
Identifier:
oai:ribes-88.man.poznan.pl:1571 ; doi:10.37055/sbn/135227 ; oai:editorialsystem.com:article-135227
Print ISSN:
Publisher ID:
License:
Starting page:
Ending page:
Volume:
Issue:
Journal:
Keywords:
factorization ; MultiPrimeRSA ECM GNFS smoothness
Object collections:
Last modified:
May 19, 2025
In our library since:
May 19, 2025
Number of object content hits:
0
All available object's versions:
https://ribes-88.man.poznan.pl/publication/1753
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| COMPARISON OF ALGORITHMS FOR FACTORIZATION OF LARGE NUMBERS HAVING SEVERAL DISTINCT PRIME FACTORS | May 19, 2025 |
Objects Similar
JURKIEWICZ Mariusz GAWINECKI Jerzy BORA Piotr KIJKO Tomasz
