Linked Questions

7
votes
4answers
11k views

Is 512-bit RSA still safe for signature generation?

The standard CSP on Windows XP only supports RSA up to 512-bit, which means that it's the maximum key size I can use for authenticity verification of updates. The public key is embedded in the updater,...
3
votes
4answers
1k views

Could a fixed RSA encryption be used instead of a salt to prevent rainbow table attacks?

It's common to use a salt before hashing a password in order to prevent an attack by rainbow tables. Would it also work to encrypt the password for instance by RSA encryption - by a permanent RSA ...
2
votes
3answers
203 views

Factoring Anderson's RSA backdoor

In 1993, Anderson [1] proposed a backdoor to the RSA key generation algorithm. This backdoor requires that a backdoor key (prime) $A$ be implanted within the key generation portion of the RSA ...
0
votes
3answers
1k views

Sign MD5 hash with RSA [duplicate]

I have to hash a message with MD5, digitally sign it, and then verify. I have looked around, but I can't find a step-by-step example. I understand how RSA works when a message is given as number (not ...
27
votes
2answers
45k views

How much computing resource is required to brute-force RSA?

It's been over 30 years since Rivest, Shamir and Adleman first publicly described their algorithm for public-key cryptography; and the intelligence community is thought to have known about it for ...
12
votes
2answers
1k views

Are there any signature schemes for underpowered devices (8-bit microcontroller)?

I am currently researching into a small scale home automation system, aiming for cost. The system architecture is basically one master and several slaves which are connected in parallel. Recently i'...
11
votes
2answers
3k views

Should RSA primes p and q differ in length by "a few digits"?

When generating RSA keys in the original RSA paper it is stated: to gain additional protection against sophisticated factoring algorithms, p and q should differ in length by a few digits Why is ...
5
votes
2answers
21k views

What is the largest bit RSA encryption to be cracked?

This article shows a 4096 bit key being cracked by using a microphone and listening to your computer's cpu. I do not know if this is true at all. I am doing a presentation on RSA Security and I ...
4
votes
2answers
157 views

RSA - Is $e = d$ a problem?

I'm working on small RSA project in university. At this moment I have done this: An array of prime numbers is generated from selected range. $p$ and $q$ selected randomly from this array $n$ ...
3
votes
2answers
8k views

How exactly are public and private keys used to encrypt and the decrypt data?

In asymmetric encryption schemes, a public key is used by an outside source to encrypt data to be sent to the holder of the private key. It's my understanding that public keys are generated from the ...
3
votes
2answers
1k views

Why are recomended RSA key lengths so high? [duplicate]

I was checking for authoritative sources to back up my recommendation of a minimum RSA key length of 1024 and was shocked to find that NIST 800-56Br1 and FIPS 186-4 both recommend at least 2048 bits ...
3
votes
2answers
568 views

Distributed integer factorization?

I'm looking around for publicly published work on factorization of large numbers using distributed systems of any kind. So far I've come across the PDF "Mapreduce for integer factorization" by Javier ...
2
votes
2answers
222 views

Actual RSA encryption & decryption of strings?

$K_{pub} = (n, e)$ $K_{pvt} = d$ Then $E_{K_{pub}}(x) \equiv x^e \mod n$ Practically, when RSA is used to encrypt strings, what is the $x$ here? You cannot take it byte by byte because $\mod n$ will ...
2
votes
2answers
1k views

Prime factorization of 700 decimal digits number

I'm a newbie to encryption. If I create a number 'n' as a product of two prime numbers 'p' and 'q' with the following specifications: 'p' is a fully random prime with 300 decimal digits in length. 'q'...
1
vote
2answers
86 views

Signature of low-entropy data: can they be faked?

I am working on an application where I have a physical product identification label containing a block of public, low-entropy data (~50 bytes) such as serial number and other info, all readily ...

15 30 50 per page