New Semi-Prime Factorization and Application in Large RSA Key Attacks

New Semi-Prime Factorization and Application in Large RSA Key Attacks

Semi-prime factorization is an increasingly important number theoretic problem, since it is computationally intractable. Further, this property has been applied in public-key cryptography, such as the Rivest–Shamir–Adleman (RSA) encryption systems for secure digital communications. Hence, alternate...

Full description

Bibliographic Details
Main Authors: Anthony Overmars, Sitalakshmi Venkatraman
Format: Article
Language:English
Published: MDPI AG 2021-11-01
Series:Journal of Cybersecurity and Privacy
Subjects:
Euler’s factorization
Pythagorean quadvery minimal, with most computations operating onruples
Pythagorean triples
Lebesgue identity
Brahmagupta–Fibonacci identity
semi-primes
Online Access:https://www.mdpi.com/2624-800X/1/4/33

Internet

https://www.mdpi.com/2624-800X/1/4/33

Similar Items