Questions tagged [key-size]
Key size is the size measured in bits of the key used in a cryptographic algorithm.
330 questions
2
votes
2
answers
52
views
Benefits and drawbacks of SSH RSA long key
I'd like to know benefits of RSA long keys (16386 and more bit length).
I know the answer for server keys, but I'd like to understand what's happening if I use such long key for a user authentication.
...
0
votes
2
answers
135
views
Should we cut the key to length KMAC128 168 KMAC256 136
KMAC128 is defined as:
newX = bytepad(encode_string(K), 168) || X || right_encode(L).
return cSHAKE128(newX, L, “KMAC”, S).
The definition of bytepad() is as ...
1
vote
1
answer
58
views
Randomly picked N-bit keys encrypting fixed M bit data: probability of two keys producing the same output
Suppose I randomly pick N=1-bit keys, and then "encrypt" the text "hello", encoded as 5 bytes of ASCII, so M=40 bits. It seems obvious, that the chance that two keys produce the ...
5
votes
4
answers
308
views
How does entropy measure the key strength?
I mean, in a pragmatic sense, in terms of a brute-force difficulty.
For example, if I have a random key accumulating $N$ bits of entropy, I’d expect to brute-force it in the order of $2^N$ trials.
It ...
1
vote
1
answer
215
views
What Makes a 2SKD (Two-Secret Key Derivation) Secure?
I'm currently studying the security mechanisms used by 1Password, particularly the Two-Secret Key Derivation (2SKD) sequence as described in section 8.2.1 of their white paper.
Here's the specific ...
1
vote
3
answers
252
views
Using shortened key for Chacha20
As I understand it, the chacha20 algorithm is designed for use with 256-bit keys, but is it possible to use shorter keys than this without compromising the security? Say if i use a 192-bit key and set ...
1
vote
1
answer
136
views
CKKS Encryption key, decryption key and evaluation key sizes
I am using CKKS to securely compute one function. I am using Pyfhel library with the below parameters for the experiment:
...
1
vote
1
answer
198
views
Cryptography key size question ASCII characters
I need help wrapping my head around this notions on the key lengths and size.
Exercise: Key sizes
Task 1: Key size
What is the key size of key for sequences of 10 ASCII characters? What is the ...
1
vote
1
answer
130
views
Key size for One Time Pad use with QKD
For a practical QKD implementation where OTP has been chosen for encrypting, how are key sizes determined?
Say, for example, Alice wishes to exchange xGB to Bob, then a key management system should ...
2
votes
0
answers
120
views
How Helpful is NXP's LRP Encryption Protocol vs AES for short keys?
NXP has a custom (I think) encryption protocol known as "Leakage-Resistant Primitive", or LRP, built on top of AES. I think the goal of this is to basically "expand" the length of ...
1
vote
0
answers
41
views
Using longer key with PKCS#5 derive_key() function for AES256? [closed]
I have code where someone made the key 64 bytes (32*2) and passes to the derive_key() function. It then uses the key created for ...
1
vote
0
answers
177
views
Would this 3AES-192 scheme achieve 384-bit key security with just a 384-bit key?
For starters, I don't need any don't-roll-your-crypto stuff. We're discussing a hypothetical.
So the idea is 3DES needs 3x the key size and achieves only 2x key size bit security. So using the 3x ...
1
vote
0
answers
80
views
Does ECC give the most secure assymetric cipher for a given public key size?
Cracking an ideal block cipher is basically a brute force key enumeration. The complexity of the attack is exponential, growing as $2^b$. Cracking ECC is also exponential, but the cost grows as $2^{\...
0
votes
0
answers
50
views
Entropy output from 256-bit Argon2 input [duplicate]
I would like to deterministically derive two different 256-bit keys from a single passphrase -- one used as an ECDSA private key, the other as a symmetric key for AES-GCM.
Would a KDF output ...
3
votes
1
answer
185
views
How much can we compress RSA public keys with two equal size factors?
Can we define an RSA variant in which the public key with $n$-bit public modulus $N$ has a compact representation of $\kappa\ll n/2$ bits, with a security argument that it is as safe as regular RSA ...