Linked Questions

1
vote
1answer
36 views

Paillier estimate attack costs on short keys

I was thinking about how to use the homeomorphic property of that cryptosystem to achieve not a "semantic security" but a less ambitous obfuscation of the source code (an ipotetical scenario ...
1
vote
1answer
78 views

Choosing a suitable prime for accumulators

I am trying to work out accumulators and generate $S = \{ e_1,e_2 \ldots, e_n \} $ from this (Section 3.4 - Choosing a Suitable Prime). For each element of $e_i$ compute its representation $x_i$.(This ...
1
vote
1answer
83 views

Which RSA keys are actually attacked In practice?

I understand that it is important to check how hard it is to attack RSA keys, but I assume at some key size attackers would not even try. Real attacks are carried out by exploiting mistakes in the ...
1
vote
1answer
429 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 ...
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
846 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
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,...
0
votes
1answer
71 views

What would be the most recommended AES && RSA Keys for production?

While I am a front-end developer and not a security expert programmer, I am worry about the keys I am using for my AES && RSA encryption. Please help me to understand: Is the following keys ...
0
votes
1answer
111 views

Reducing a 64 digit integer to 10 digit

Situation:- I am using Python. I am using RSA and I am using two 64 bit keys. I am not an cryptographer . I can provide you the RSA code if needed but i am not posting it as it doesn't have to do ...
-1
votes
1answer
98 views

3 digit code at the end of a changing magstripe (maybe hash?) [closed]

Myself and some fellow students are doing some "Independent Security Research" on campus and trying to crack the campus paid parking system to better understand how it might work. The system works ...
1
vote
0answers
56 views

Will a list of all prime numbers upto certain number of bits compromise crytopgraphic algorithms based on prime factorization? [duplicate]

I understand that many cryptographic algorithms depend on the difficulty of large prime factorization. Will a list of all prime numbers upto certain number of bits make it easy for an attacker to ...
1
vote
0answers
81 views

How does RSA encrypt a message? Are the message packets chained together?

This question is quite related to this one, but I am looking for more details. I am writing a very basic implementation to demonstrate how RSA works. My current implementation generates key pairs ...
1
vote
0answers
238 views

Is a RSA 2048 bits public key secure [duplicate]

I realize servers such as Google, Yahoo, which use RSA has 2048 bits public key. After comparing those keys, I realize that the public keys share a common property, that is first 9 bytes and last 5 ...
1
vote
0answers
68 views

Minimum length of PKI key for signature [duplicate]

I am looking for data which shows how time it would take to brute force (or crack by any other method) different sizes of RSA/DSA keys used for a digital signature. I am looking to use as small a ...
0
votes
0answers
195 views

Parameters and key dimension for DH and RSA

I studied RSA and Diffie-Hellman key exchange from a quite old book (Discrete Mathematics by Berardi, Beutelspacher) and so I wonder if the recommended dimensions for the prime p and the secret ...

15 30 50 per page