44
votes
Accepted
Largest integer factored by Shor's algorithm?
wondering what the largest integer is which they were able to factor with a small quantum computer
This answer starts with two classes of factorization efforts: stunts and adiabatic quantum computing ...
33
votes
What is the maximum size of the plaintext message for RSA OAEP?
The input length of OAEP is directly specified in the standard:
...
- 87.1k
26
votes
Accepted
Argon2 output length and parameter storage?
You need to consider the weakest link property: a security system is never stronger than its weakest link. Since Argon2 is a password-based function, the weak link here is going to be the strength of ...
- 14.1k
23
votes
Accepted
1 Billion Bit Encryption?
Examining his claims about "Thundercloud":
You can use it with "any existing software, operating system, or device" (a massive amount of effort---by whom?)
Has its "own cryptographic language that is ...
- 6,689
22
votes
What size should the HMAC key be with SHA-256?
The only rule for the key is that it should at least contain 256 bits of randomness. If the key is smaller you may not get the full security of HMAC-SHA-256. The full security of HMAC is basically ...
- 87.1k
21
votes
What is the minimum and maximum value of an RSA private exponent?
In summary:
Modern practice is to fix a small public exponent $e$ such as $e=2^{(2^4)}+1=65537$, then choose a public modulus $N$ of $\text{nlen}$ bits (the key size) with large random prime factors ...
- 128k
20
votes
What is the history of recommended RSA key sizes?
512 bits (rounded down from the 664 bits or 200 digits in the patent) was recommended from its conception in 1974 and throughout the 1980s. Indeed, 463 bits was considered sufficient in the mid-1990s ...
- 740
17
votes
Accepted
What is the maximum key size for a 128 bit AES?
Despite similarities, it is really important to understand that passwords and cryptographic keys should not be carelessly conflated. Some important contrasts:
Passwords are normally selected by ...
- 14.1k
14
votes
Accepted
Password entropy much lower than entropy of encryption keys. Why is this acceptable?
I know that humans would find it impossible to maintain a 128 bit password -- however, I wonder if there is some technical reason why a 52 bit password would not be as weak as a 52-bit encryption key ...
- 31.5k
14
votes
Is there any benefit from using SHA-512 over SHA-256 when AES just truncates it anyway?
SHA-512 has both a larger internal state and a higher number of rounds than SHA-256 - which means that it provides a higher bit strength. Somewhat surprisingly it may also outperform SHA-256, as it ...
- 87.1k
14
votes
Brute-forcing Symmetric Keys
No, it doesn't help. It doesn't hurt either; as long as you don't repeat keys, the probability of success is always the same. That is, if there are $2^n$ possible keys, and you test $\lambda$ of ...
- 135k
13
votes
Accepted
How do I get the equivalent strength of an ECC key?
The security level of an elliptic curve group is approximately $\log_2{0.886\sqrt{2^n}}$. You can use this to approximate the security level of a $n$-bit key, eg:
$\log_2{0.886\sqrt{2^{571}}} = 285....
- 320
13
votes
What is the purely mathematical definition of encryption strength?
There isn't just one, because there are many different scenarios where you'd use such a function, where the attacker has lesser or greater powers, or variably stringent success goals—different attack ...
- 14.1k
12
votes
Key sizes supported by 3DES
The triple DES (3DES) block cipher works by essentially running the block through DES three times. Triple DES is also known as "DES EDE" (encrypt-decrypt-encrypt) and under the name given by the ...
- 135k
12
votes
Accepted
Why can't we give block ciphers larger keys?
I saw many people complainig about AES , twofish and serpent that these ciphers all could be crackable in the near future and even today with big datacenters .
This is a good example of why we should ...
- 19.3k
11
votes
Accepted
80-bit collision resistance because of 80-bit x87 registers?
Coprocessors are designed for improved performance in a certain case, and in the case of fixed-width mathematics, I do not believe you would see a performance increase.
I am quite sure that 80-bits ...
- 4,309
10
votes
What is the maximum key size for a 128 bit AES?
AES-128 requires keys 128 bits in length, period.
As Thomas points out in his comment, the size of characters is encoding-dependent, so there is no well-defined "number of characters" in an AES key. ...
- 10.7k
10
votes
Why can't we give block ciphers larger keys?
I saw many people complainig about AES , twofish and serpent that these ciphers all could be crackable in the near future and even today with big datacenters
Let me go through some of the lesser ...
- 135k
10
votes
Nexor, an encryption algorithm that promises unlimited key sizes: Is it safe?
Looking very briefly at the source, it's just using the output of /dev/urandom to generate keys, then using that as a (poor) One-Time Pad. /dev/urandom is just a ChaCha20-based RNG with some decent ...
- 5,256
9
votes
How big an RSA key is considered secure today?
An adversary with a moderately large quantum computer to run Shor's algorithm will cut through a 1024-bit RSA modulus like a hot knife through butter, and maybe through a 2048-bit RSA modulus like a ...
- 46.5k
9
votes
Accepted
AES-256 password cracking time
It will happen immediately, because you just posted your password to the internet, where the adversary is watching.
On the other hand, if you can describe the procedure you used to generate it, we ...
- 46.5k
9
votes
How Secure is gpg Command Using Symmetric AES-256 From Being Cracked
GPG's AES-256 symmetric encryption is believed to be as secure as it is difficult to
guess the passphrase
or compromise the machine used to perform encryption and decryption.
Guessing the passphrase ...
- 128k
9
votes
80-bit collision resistance because of 80-bit x87 registers?
The original SHA-1 and Skipjack specifications did not provide a justification for using a 80-bit key size, so we can only speculate about the reasons. However, it is important to understand that ...
- 35.7k
8
votes
Accepted
Can there be a need for 1024-bit (symmetric) encryption?
In order to answer this question, we need to understand the basis behind all of modern cryptography, which is computational hardness. Today, we believe that we know how to construct block ciphers that ...
- 27.1k
8
votes
Key Size for Symmetric Homomorphic Encryption Over the Integers
The paper says that the parameters are $r ≈ 2^{\sqrt \eta}$ and $q ≈ 2^{\eta^3}$. Note that these values are expressed as functions of $\eta$, not $N$.
With regard to the parameters, it is common ...
- 4,842
8
votes
Accepted
For RSA keys, is the safety of a given key-length different for signing vs encryption?
No, the security is about identical, as the underlying RSA problem is the same.
Besides that, non-repudiation is usually managed differently with regards to legal requirements. Providing ...
- 87.1k
8
votes
Accepted
How secure is AES-256, but with an effective key length of 56-bits?
It would appear that this is as a consequence of the Wassenaar Arrangement (more detailed explanation). Basically, because cryptography falls under certain laws regarding munitions and arms ...
- 3,982
8
votes
What is the purely mathematical definition of encryption strength?
One of the definition is stated in the other answer (indistinguishably). Another way to assert the strength of an algorithm is to compute the complexity of an attack.
Let us assume $$E : \mathcal{K} \...
- 9,869
8
votes
Why can't we give block ciphers larger keys?
Cryptographers can and we do create block ciphers with bigger keys, take for instance the Threefish cipher which has key/block sizes of 256, 512 and 1024 bits.
However, since strong block ciphers ...
- 87.1k
8
votes
What is the minimum and maximum value of an RSA private exponent?
Modern cryptography generally chooses a static public exponent. Nowadays this is almost universally the fifth prime of Fermat or F4, 65537 or 010001 in hexadecimals. From this the private key is ...
- 87.1k
Only top scored, non community-wiki answers of a minimum length are eligible