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

Published in:	Journal of cybersecurity and privacy Vol. 1; no. 4; pp. 660 - 674
Main Authors:	Overmars, Anthony, Venkatraman, Sitalakshmi
Format:	Journal Article
Language:	English
Published:	Washington MDPI AG 12.11.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!