Questions tagged [key-size]
Key size is the size measured in bits of the key used in a cryptographic algorithm.
301
questions
0
votes
1
answer
44
views
What are Key Size requirements (rather than modulus size) for different Asymmetric Algorithms for 112-bit security?
A lot of writeups, books & webpages say that to get 112 bit security (i.e $2^{112}$ steps), you need to use RSA or DH with 2048 key size or ECDH with 224 key size. In reality, I think what is ...
- 1,871
1
vote
2
answers
121
views
Is it possible to generate a key from a hash function, being the key larger than the hash function digest output without spliting the seed?
Let's suppose I have a 2MB photo and I want to generate a key from it, and the key should have 2048-bits of size.
A hash function such as SHA3-512 would not deliver a key with with the desired ...
- 635
1
vote
1
answer
41
views
Security of the encryptions, using a PRG for the keyGen
I recently got doubtful to the usefulness of psuedorandom generators(PRG) in cryptography.
Based on Kereckhoff's principle, we always assume that the used algorithms are made public.
So, when we use a ...
- 220
0
votes
1
answer
36
views
Are there any encryption schemes where more than one key give the same encryption and decryption operations? [duplicate]
Given an encryption scheme that takes as input a key $k$ and converts it to an encryption operation $E$ via the function $M(k) = E$, is it possible that more than one $k$ can give the same $E$?
For ...
- 101
0
votes
1
answer
154
views
IIS Crypto 3.2 not getting rid of Diffie Hellman algorithms of less than 2048 bits ... or am I missing something?
I'm trying to stop a server using Diffie Hellman algorithms of less than 2048 bits ..but I'm getting confusing results
I've run
...
- 11
2
votes
0
answers
69
views
Historical key sizes for RSA and discrete log [closed]
What is the historical pattern for key size increases for rsa vs discrete log?
What are the current and future projected sizes for these?
- 882
0
votes
1
answer
263
views
64 bit key size Diffie Hellman
I am building a cryptographic El Gamal implementation on the Cardano Blockchain for a poker game. Each hand the players generate a DH 64 bit keys and shuffle the cards together via homomorphic ...
- 101
2
votes
1
answer
64
views
Can the security margin of any Feistel block cipher be multiplied if I just multipy the number of rounds and use different random subkeys each round?
Kaweichel is a port of Blowfish for 64-bit architectures, its key size accepted is 1920-bytes, instead of 16 rounds it has 32 rounds, the double of Blowfish.
ICE is a feistel block cipher that has a ...
- 635
0
votes
0
answers
26
views
Does the security margin of Kalyna block cipher double per for additional 4 rounds? Would be possible to create a version of it with larger key sizes?
I believe this question should be directed to the authors of Kalyna block cipher, but I think they cannot answer me because of the war they are facing in their country actually.
I know that AES uses ...
- 635
0
votes
1
answer
131
views
Confusion of message space and key space
i just a bit confused that is it reasonable to assume that the probability of sending message $m \in M$ is uniformly distributed over the message space $M$? How is this different from assuming that ...
- 15
1
vote
2
answers
67
views
Small public key size or small signature size, which is preferred?
Suppose two signature schemes provides the same level of security. The sum of the sizes of a public key and a signature, i.e., sizeof(sig) + sizeof(pk), are equal in the two schemes. One of the ...
- 13
2
votes
1
answer
367
views
Argon2 allows a huge key length in input, but does it really provide the security of the key provided?
I read the Argon2 specification.
It says in 3.1 (Page #5):
Secret value K (serves as key if necessary, but we do not assume any key use by default) may have any length from $0$ to $2^{32}\text{-}1$ ...
- 635
1
vote
1
answer
109
views
Is multiple encryption with XTS mode susceptible to Meet-in-the-middle attacks?
Let's suppose I encrypt something with AES-256 in XTS mode two times (there will be 4 four keys, 2 for each encryption operation), wanting to achive 512-bits of security.
Will this scheme be ...
- 635
0
votes
0
answers
58
views
Is there a way of preventing meet-in-the-middle attack when using double-encryption?
Let's suppose I encrypt something with AES-256 two times using 2 different keys wanting to achieve 512-bits of security. I know that this scheme will in fact give me only 257-bits of encryption ...
- 635
2
votes
0
answers
89
views
How much information is required to specify a new variant of AES beyond the key length and the number of rounds?
Three different versions of the Advanced Encryption Standard (AES) have been standardized, which use keys of bit length 128, 192, and 256 respectively. They also use different numbers of rounds: 10, ...
- 163
0
votes
1
answer
96
views
Can the security of Salsa20/Chacha20 be expanded to 448-bits if I fill the nonce and the Nothing-up-my-sleeve numbers with key material?
As I studied, Salsa20/Chacha20 is basically a hash function that accepts a 64-byte input and returns a output of the same size of input.
128-bits of the input are filled with four "Nothing-up-my-...
- 635
1
vote
0
answers
21
views
How can a generate a key with defined key size with a hash function with its security/internal state shorter than the key?
Let's suppose I took a high resolution photo full of entropy and I want to convert in a key with 2048-bits of security.
Practically all the known hash algorithms have maximum 512-bits of security.
Is ...
- 635
2
votes
1
answer
964
views
Nexor, an encryption algorithm that promises unlimited key sizes: Is it safe?
My intention is not to make spam here, but I came across this project in Github: https://github.com/andrewhodel/nexor
It's an algorithm called Nexor, it promises encryption with unlimited key sizes.
...
- 635
0
votes
2
answers
105
views
Hashing 64-bit counters with different keys and XORing to blocks of plaintext, multiple times: Some questions
Let's suppose I want a 2048-bit block encryption.
I take a 512-bit hash funcion (as Blake2b), provide a counter and a key and hash the counter and so XOR the hashed value in a ciphertext block, and ...
- 635
0
votes
0
answers
50
views
Questions about Blake2x: Its state size (internal state) and its security when generating keys with size more than 256/512bits
I read the Blake2x paper: https://www.blake2.net/blake2x.pdf
It says Blake2x can be used to build a "DRBG" (CSPRNG): https://csrc.nist.gov/glossary/term/deterministic_random_bit_generator
&...
- 635
0
votes
1
answer
83
views
CTR and OFB block cipher modes and their post-quantum security. Some questions [duplicate]
It's said that quantum computers can break block ciphers with 2^(n/2) queries (being n the key size).
I read this paper: https://eprint.iacr.org/2016/197
It says that CTR and OFB modes are safe ...
- 635
2
votes
2
answers
179
views
What's bad about idea of public-key/one-time-pad hybrid cryptosystem?
As i know, generally nowadays hybrid protocols are more widely used than either symmetric or public key cryptosystems separately. I read that public key system is used to exchange and share secret via ...
- 71
3
votes
1
answer
108
views
Questions: Argon2, its internal state and security of it when generating keys larger than 256/512 bits
Let's suppose I want to use a cipher with a large key size, such as ISAAC that supports 8192 bits ogf key.
I can hash with sha-256 or sha-512 and iterate until reaches the key size but I won't get ...
- 635
0
votes
2
answers
151
views
Bringing a key to 256 bit by a hash algorithm
For example, if I use Rijndael for encryption, I have to specify a key of a certain length. For user convenience, I want the user to be able to use a key of any length. Then, to get the key to the ...
- 37
0
votes
0
answers
63
views
Breaking vigenere cypher using the one-time pad flaw when used for a second time
I got an idea which may be wrong because I may have missed some important factor but for the moment I don't know if I really did. Let BM be the method used to break a reused one-time pad cipher (which ...
- 1
0
votes
1
answer
125
views
how to break AES [duplicate]
why is breaking a (asymmetric) 1024 bit RSA key less difficult than breaking a 128 bit (symmetric) AES key? Breaking RSA key involves finding the prime factors of a large number. What is involved in ...
- 11
1
vote
0
answers
50
views
Why can't we have AES512 or more? [duplicate]
Look I know AES256 is ridiculously secure but to keep aes secure even after quantum computers, I have a concern.
Using the Grovers theorem aes can be reduced from 256 to 128 bits for brute force ...
- 11
0
votes
2
answers
244
views
How does AES-256 works if AES is only a 128-bit block cipher?
I'm currently studying AES encryption and I'm quite confused on how do we use a 256-bit key in AES?
Becuase in my understanding, AES no matter what the key size is, it still operates and encrypt a 128-...
- 105
2
votes
0
answers
43
views
Constants of 128-bit key version of the stream cipher Chacha [duplicate]
I am trying to find constants of 128-bit key version of the stream cipher Chacha.
I know for 256-bit key version, constants are 0x61707865, 0x3320646e, 0x79622d32, 0x6b206574.
Are these same for both ...
- 219
1
vote
1
answer
119
views
Can we determine the size of n-bytes before encryption by AES-128?
I am writing a program in python to encrypt files. This program
takes subsequent 1024*1024 (1 mebibyte) chunks of data from a file and encrypts it using AES-128. This is performed in a loop until all ...
- 11
3
votes
1
answer
916
views
How many Bits/Bytes is a public key, given its encoding
I am struggling to understand what the "bit/byte" size of a public key is, how you can work it out, and even what it means.
An example of a RSA public key is:
AAAAB3NzaC1yc2EAAAABJQAAAQB/...
- 51
2
votes
2
answers
671
views
Time Complexity of Exhaustive Search Algorithm
I have the sets $S_1=\{2,10,20,6\}$ and $S_2=\{25,26,20\}$ and I want to find which numbers sum to make 32. This is very easy by inspection; 6 and 26. It seems similar to the Knapsack problem, but I ...
- 51
1
vote
1
answer
313
views
Key space of a substitution cipher
I was going through a cryptography course, and I found a question there that: What is the size of the key space of the substitution cipher with 26 letters?
Its answer was 26!
I am not sure what this ...
- 11
0
votes
1
answer
51
views
When using prime factorization for key gen, is there a limit on the size of the prime factors?
If there is a limit, does that leave a limited number of prime numbers that can be used for key gen? And, if that is the case is the encryption system vulnerable?
- 125
0
votes
1
answer
528
views
Public key size for different elliptic curves
Let's say I want a certain level of security (eg 128 bits) when using ECIES but I also want to minimise communication, does the elliptic curve used matter on the size of the public key? If it does ...
- 67
1
vote
2
answers
2k
views
So is AES-256 more secure or less secure than AES-128 after all?
It seems there are attacks that work more effectively on AES-256 than AES-128, which makes it less secure in some cases. But the bigger key size should add some safety margin on the other hand, for ...
- 647
1
vote
1
answer
122
views
Does key sizes specified in ASD Approved Cryptographic Algorithms impact operational performance?
Does the key sizes specified in Australia's ASD Approved Cryptographic Algorithms impact operational performance?
The larger the key size the slower the operational performance. Is it true?
The set of ...
- 53
1
vote
1
answer
441
views
Is it alright to generate RSA keys with bit sizes other than 512/1024/2048?
I am keep generating RSA keys for 512/1024/2048/4096... as bit size. Each time the key length is increasing.
Is it possible to generate/use keys other than the ...
- 113
3
votes
2
answers
1k
views
Is there much difference in a RSA-4096 over RSA-3072 for support/speed and security?
I am in the process of created a signing certificate and i have an option of RSA-4096 or RSA-3072.
Is there much difference in security between the two? I know people say RSA-3072 should be good until ...
- 131
1
vote
3
answers
189
views
Is it possible to increase the encryption security of a short key?
If I encrypt a file with a short 4 digit pin is there any way to make it more secure. I've thought about hashing the 4 digit pin and using the result as the encryption key. I think this would work as ...
- 113
0
votes
1
answer
192
views
Leighton-Micali Hash-Based Signature key sizes
I am working with the RFC for Leighton-Micali Hash-Based Signatures: RFC-8554.
The question is if I understood it correctly and my calculations of the key sizes are correct.
Basically, LMS uses ...
- 143
0
votes
1
answer
52
views
Small values with non-uniform distribution encoded as large values with uniform distribution
Given a non-uniformly distributed set of 32-bit values (for example), is there a way to reversibly encode each one as a 128-bit value (for example) where they'd be approximately uniformly distributed ...
2
votes
1
answer
54
views
Can you use a dynamic key and data size for KMAC?
I've asked before if some kind of canonical encoding should be used on the input parameters of SHA-3 before it could be used as replacement for HMAC.
However, if I read the current NIST specifications ...
- 87.1k
5
votes
1
answer
308
views
What are the public key and output sizes for the four remaining PQC KEM candidates?
Currently there are only 4 direct candidates left that provide KEM. Generally performance seems to be "OK" for those candidates. However, the key and encapsulated key sizes (i.e. the output ...
- 87.1k
2
votes
0
answers
53
views
What grade of protection does a private key's passphrase provide at best?
Does a passphrase with high entropy provide the same level of security as the private key itself?
General scenario: An attacker has access to a private key file that is protected with a passphrase ...
- 121
2
votes
1
answer
313
views
Bruteforcing a symmetric cipher [duplicate]
I don't understand how we could bruteforce a symmetric cipher.
Let's take AES with a key size of $128$ as an example. It means that there are $2^{128}$ possible keys, and as many ways to decrypt a ...
- 231
0
votes
1
answer
160
views
Calculating symmetric key bit strength
16 byte key where each byte is in range 0-255, generated using cryptograhic PRNG will be believed to have 128 bit strength.
What would be a bit strength of a key generated using same quality PRNG, ...
- 471
0
votes
2
answers
136
views
Cryptography standards on key size
There are many limits on key size. As far as I know 56 bit in USA and 40 bits in India without license. On the other hand much higher 128 bit or 1024 or 4096 bit for banking and other purposes. So ...
0
votes
0
answers
53
views
Chaining signatures of different parties
My question might be quite beginner, so please pardon my ignorance :)
So, assume there are 10 parties, each with their own keypairs. There is a message $M$ that is passed from one party to the next. ...
- 177
1
vote
1
answer
841
views
How to calculate time needed for decryption of 64-bit key
I am having trouble figuring out how long it takes to decrypt a 64-bit key, given that a computer can do 1 billion trials per second. I know that there are $2^{64} = 1.844 \times 10^{19}$ possible ...
