RSA Modulus Obfuscation Using a Reversible Transform Function
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing computational power and potential of quantum computers threaten the security of RSA encryption by making it susceptible to factorization attacks, posing existential risks to the Internet's security framework.
Innovation Solution
Ladhe's Algorithm enhances RSA security by obfuscating the modulus n through a reversible transform function, using a pseudo modulus S that is distributed instead of the real modulus n, known only to a trusted agent, thereby thwarting factorization attacks without increasing key length.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the key length is increased to make factorization attacks more difficult, then security is improved, but computational efficiency deteriorates
Solution Approach 1:
The patent segments the security problem by separating the modulus n into two components: a public pseudo-modulus S that can be freely distributed, and a private secret component kept by the key owner. This segmentation allows maintaining strong security without requiring excessively long keys, as the security now depends on protecting the secret component rather than the entire key length.
Solution Approach 2:
The patent introduces a trusted agent as an intermediary that helps establish secure communication without requiring direct key exchange. The trusted agent distributes the pseudo-modulus S and facilitates the key establishment process, thereby improving security while maintaining computational efficiency through standardized protocols.
2Reliability
If the key length is increased to prevent factorization attacks, then security is improved, but device complexity increases
Solution Approach 1:
The patent segments the key management process by separating public and private components. The pseudo-modulus S is distributed publicly while the secret component remains private, simplifying key management operations and reducing device complexity compared to managing entirely longer keys.
Data Source
AI summary
The present disclosure relates to a security enhancement to the RSA algorithm, referred to as Ladhe's Algorithm, that vastly increases security without increasing key length. This security enhancement is achieved by obfuscating the modulus n through a reliable and reversible method to eliminate the possibility of factorization attacks. In embodiments of the present disclosure, the security of RSA is enhanced without increasing the key length by applying a mathematical function, referred to herein as the transform function ft, to the prime number p and q, to obtain a pseudo modulus S that is distributed in place of the real modulus n with the public key. The pseudo modulus S has two parts: a code associated with the transform function and a value derived from p and q. The code serves as an index to a table or other data structure that maps the code to a particular transform function. The transform function is known only to a trusted agent (TA). Only the TA is able to derive the real modulus n from the pseudo modulus S.