Computing Power, Key Length and Cryptanalysis. An Unending Battle?
This work addresses the ongoing challenge of ensuring encryption security over time for users and systems relying on asymmetric cryptography, but it appears incremental as it reviews and formalizes existing concepts rather than introducing new breakthroughs.
The paper tackles the problem of estimating the security lifespan of factoring-based encryption methods like RSA by establishing a relationship between computing power and key bit length, aiming to predict how long an encryption will remain secure against attacks.
There are several methods to measure computing power. On the other hand, Bit Length (BL) can be considered a metric to measure the strength of an asymmetric encryption method. We review here ways to determine the security, given an span of time, of a factoring-based encryption method, such as RSA, by establishing a relation between the processing power needed to break a given encryption and the given bit length used in the encryption. This relation would help us provide an estimation of the time span that an encryption method for a given BL will be secure from attacks.