Linked Questions

1
vote
1answer
8k views

How long to bruteforce a RSA key [duplicate]

Suppose I have a 2048 bit RSA public key, and want to brute force the corresponding private key. I guess there are 2048^16 possible combinations? How long would this take me to brute force with an i7,...
4
votes
1answer
1k views

RSA time function

I am doing a paper on textbook RSA (highschool-level). I am explaining and proving the significance of the public key exponent in time and security. So far, I have encrypted a constant message with a ...
21
votes
1answer
2k views

Security of RSA for paranoids with padding?

RSA for Paranoids (RSAP) (in CryptoBytes v1n3), also known as Unbalanced RSA, is a variant of RSA proposed in 1995 by Adi Shamir, as a mean to increase the RSA public modulus size while keeping ...
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 ...
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'...
0
votes
2answers
1k views

Practical Attack on RSA

Currently I am designing an RSA based application, and I am thinking of how long should the key be in order to be secure against attacks. I know that RSA 4096 bit key can be recovered using Sound ...
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 ...
1
vote
1answer
1k views

How should I address message size limits in RSA encryption?

I am making an end-to-end encryption software program in Java using RSA. I am using BigIntegers and its number theory methods. (I know this is a very slow approach, but I just want to learn to the ...
1
vote
1answer
458 views

80-bit security and attack time

Many designer claimed that their cryptography scheme has 80-bit security. So how to calculate the time of attcking this 80-bit security cryptography scheme, such as 80-bit security RSA using a kind of ...
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
1answer
852 views

Small Encryption Exponent

I am trying to crack an unpadded RSA set up for a homework. I have public key (R,e) and encrypted message E. ...
1
vote
1answer
849 views

RSA finding p and q integer with condition

I'm given $N=p\,q$ and told that $44\,p\approx 17\,q$ (with the value given for $N$ some 49-digit integer 8124642558124642555899928124642555899924479992447). In ...
-1
votes
2answers
645 views

Rsa encryption security

What tool is used to measure the security of rsa encryption? If no, is there any tool to measure rsa encryption in terms of security. Or any idea how to measure security of rsa encryption?
2
votes
1answer
612 views

Is Shoup's Practical Threshold Signatures considered secure?

I am planning to use threshold cryptography in a Java application. So far, I have only found ThresSig and a ECDSA implementation used in TwoFactorBtcWallet. However, ThresSig is based on a 15-years ...
2
votes
2answers
219 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 ...

15 30 50 per page