Number Field Sieve Cryptanalysis Algorithms for Most Efficient Prime Factorization on Composites
Number Field Sieve Cryptanalysis Algorithms for Most Efficient Prime Factorization on Composites
Y. Malhotra
2013 · DOI: 10.2139/SSRN.2553544
1 Citations
TLDR
The reformulations of the two fundamental axioms underlying the formulation of cryptography and encryption standards are proposed based on earlier research in the form of the ‘principle of no secret keys’, which are anticipated to contribute to development of more robust encryption mechanisms.
