New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

# Tag Info

Accepted

### Does Schnorr's 2021 factoring method show that the RSA cryptosystem is not secure?

No. If the claim was true, then there would be an extremely simple way to prove it: $10^{10}$ arithmetic operations is nothing. There are tons of 800-bit factoring challenges available online. The ...
• 20.2k
Accepted

### Cracking RSA (or other algorithms) manually by a savant

Mental calculators do not have the result appearing in their brain by staring at the input. They follow some (broadly sequential) algorithm¹. And computers vastly outperform them when they use the ...
• 142k

### Does Schnorr's 2021 factoring method show that the RSA cryptosystem is not secure?

Big issue at the bottom of page 2 where the determinant is quoted as $N^{n+1}\frac{n(n+1)}2 \ln n$ when it should be $N^{n+1} n! \ln n$. If this formula is used directly in the numerical estimates ...
• 23.9k
Accepted

### Why is it not possible to increase the size of RSA keys indefinitely?

I've never heard that RSA becomes less secure when the modulus grows. Obviously the strength doesn't grow as fast as the number of bits, but that only means that it grows sub-exponentially. If it ...
• 92.9k
Accepted

That number was so quick to factor because its factors are extremely close together, i.e., it factors as $\left(\lfloor\sqrt{n}\rfloor + 70\right)\left(\lfloor\sqrt{n}\rfloor - 68\right)$. Some ...
• 12.6k
Accepted

### What is the progress on the MIT LCS35 Time Capsule Crypto-Puzzle?

2) Has anyone claimed to make any progress with this challenge? Ah that question I can answer now... I found the solution on the 15th of April 2019 and sent it to the MIT's CSAIL on the 16th of ...

### Why is it not possible to increase the size of RSA keys indefinitely?

I don't understand at all what this claim is on the website. The claim that RSA becomes very expensive for large $N$ is true, but to say that the gap between encryption/decryption cost and factoring ...

### Does Schnorr's 2021 factoring method show that the RSA cryptosystem is not secure?

The error in upper bounding the determinant of the matrix $\mathbf{R}_{n,f}$ by $$N^{n+1} \frac{n(n+1)}{2} \ln N$$ instead of by $$N^{n+1} n! \ln N$$ seems to lead to an error in upper bounding the ...
• 22.6k

### Cracking RSA (or other algorithms) manually by a savant

Your thinking is against the common sense in cryptography and computing. And to be blunt, it's blatant pseudoscience. Human brains and the neurons within operate on scalar states. While it's arguable ...
• 9,361
Accepted

### How long does it take to crack RSA 1024 with a PC?

RSA-768 took 2000 years of 2.2Ghz single-core Opteron from the year 2009. DJB et al wrote in 2013 (see page 30) (see also: 29C3: FactHacks (EN); slide 87/112; about 10 minutes) that RSA-1024 would ...
• 824

### Safe primes in RSA

First we may want RSA primes to be something like a safe prime, ie a prime $p$ where $(p-1)/2$ is prime as well. Back in 1974 Pollard found an algorithm to factor moduli whereby you can factor $N=pq$ ...
• 46.1k

### What is the efficiency of the new Crown Sterling semiprime factoring method?

The bozos at Clown Sterling have adapted the advanced technology of bogosort to factoring: randomly blow a candidate solution out your nose and check whether it works. For a semiprime $n$ chosen by ...
• 48.5k
Accepted

• 5,836