@misc{KIJKO_Tomasz_COMPARISON_2014-12-05,
 author={KIJKO Tomasz and WROŃSKI Michał},
 howpublished={online},
 year={2014-12-05},
 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.},
 title={COMPARISON OF ALGORITHMS FOR FACTORIZATION OF LARGE NUMBERS HAVING SEVERAL DISTINCT PRIME FACTORS},
 doi={10.37055/sbn/135227},
}