10/07/2016

FranceWeb,e-GlobalNetWork® is the largest sociotechnical system humankind has ever seen. It has changed the way we interact, learn and innovate. Almost daily it appears to change, improve and increase its hold on us.In fact , it has been created for anyone interested in virtual worlds and social networks whether commercialy, because you want to explore the possibilities such environments present, or for academic curiosity. It is the result of a major collaborative effort by members of the same business faculty, to identify and define solutions for the most frequently occuring issues and problems for small, medium and large businesses as well as for non-profit organisations.

Number Field Sieve Cryptanalysis Algorithms for Most Efficient Prime Factorization on Composites

Yogesh Malhotra

Global Risk Management Network, LLC

May 3, 2013

Abstract:

Real defense or sustained viability of any encryption standard or encryption algorithm depends upon the “practical impossibility, in any foreseeable future” of “factoring the product of two large primes”. Hence, the factoring algorithms that make the process of breaking such encryption benchmarks easier, cheaper, and faster are of vital importance. For instance, Number Field Sieve (NFS), in its various forms, is currently recognized as the most powerful family of factoring algorithms used in most recent factoring attacks on global online financial transactions and payments encryption mechanisms. Based upon in-depth technical and mathematical analysis of the NFS and extrapolation of the trend of RSA encryption standards that have already been known to be compromised, plausibility of the current global 'gold standard' of online encryption, RSA-1024, having also been probably compromised in the wild, even though not disclosed publicly, is considered. The analysis is further substantiated by the plethora of recent public evidence about increasingly alarming and devastating cyber-intrusion attacks in the history of the WWW.

The two fundamental axioms, Shannon’s Maxim and Kerckhoffs’s Principle, underlying the formulation of cryptography and encryption standards are analyzed to examine how they can be advanced in order to develop more robust encryption and cryptography mechanisms that can withstand the onslaught of attacks using increasingly sophisticated and efficient cryptanalysis algorithms such as NFS. 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’. Specifically, Shannon’s maxim: “The enemy knows the system” is hence reformulated as “The enemy knows the system, but you ‘know’ better.” Specifically, Kerckhoffs’s principle: “A cryptosystem should be secure even if the attacker knows all details about the system, with the exception of the secret key.” is hence reformulated as “A cryptosystem should be secure even if the attacker knows all details about the system including the secret key.” These reformulations of the fundamental axioms of cryptography and cryptanalsyis are anticipated to contribute to development of more robust encryption mechanisms.

Note: Within four weeks of the original publication of this research report, Google announced its intent to switch from RSA-1024 to RSA-2048. The original report was published about two weeks before the revelation of the Snowden affair in the public media.