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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of cybersecurity and privacy Jg. 1; H. 4; S. 660 - 674
Hauptverfasser:	Overmars, Anthony, Venkatraman, Sitalakshmi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Washington MDPI AG 12.11.2021
Schlagworte:	Algorithms Brahmagupta–Fibonacci identity Cryptography Euler’s factorization Lebesgue identity Mathematicians Methods Prime numbers Pythagorean quadvery minimal, with most computations operating onruples Pythagorean triples semi-primes
ISSN:	2624-800X, 2624-800X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!