Abstract

In cryptography, the Integer Factorization Problem (IFP) has significant importance because many cryptosystems with public keys ground their security on the hardness assumption of it. For example, RSA Laboratories launched many competitions that targeted IFPs [1]. The IFP problem consists of writing an arbitrary integer as a product of powers of prime numbers. Note that every integer number can be written as a product of prime numbers and that product is unique. At the same time, IFP is interesting because it combines elements of number theory with elements of complexity theory.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.