43 minutes ago · Tech · hide · 0 comments

Eric Lu announced on X today that he has factored RSA-260, a number N with 260 digits (862 bits) that is the product of two large primes [1]. RSA numbers are challenge problems posed to gauge the security of RSA encryption, which rests on the difficulty of factoring large numbers [2]. The naming scheme is confusing because RSA-n might have n digits or n bits. For example, RSA-768 is smaller than RSA-260 because the former has 768 bits and the latter has 260 digits. RSA-260 is the largest RSA number factored so far. What does the news of its factorization say about the security of RSA? Based on equations here, an RSA key with 862 bits would have a security level of 74 bits, i.e. the same security level as symmetric encryption with a 74-bit key. The minimum recommended RSA key size now is 2048 bits, which has a security level of 107 bits. Security levels are on a logarithmic scale: each additional bit of security doubles the effort required to break the encryption by brute force. So…

No comments yet. Log in to reply on the Fediverse. Comments will appear here.