Skip to main content

Questions tagged [related-keys]

Keys with an exploitable mathematical relationship, and the attacks they enable

0 votes
0 answers
86 views

Out of all the block cipher key schedules in currently existence, which one(s) would be good to reuse in new block cipher designs? I've seen someone on here state that Rijndael's key schedule is a ...
Melab's user avatar
  • 4,328
1 vote
1 answer
148 views

We know that Schnorr signature is applied this way: Key Generation Define curve $E$, field $\mathbf F_q$, order $N$, generator $G$, and hash $h$. Private key: $d \in (0, N)$, Public key: $P = dG$. ...
allexj's user avatar
  • 163
0 votes
0 answers
57 views

I am going through the paper https://www.iacr.org/archive/fse2013/84240283/84240283.pdf where the related key security of CBC mode of encryption is well analyzed. I am concerned about whether the CFB ...
Crypto_Lover's user avatar
0 votes
1 answer
159 views

Kerberos (and I assume other Trusted Third Party protocols) use (hash) an existing shared secret key to create a session key used for authentication. I read that this authentication secret key can ...
Elliot's user avatar
  • 3
2 votes
1 answer
278 views

What issues do yall see with the following in terms of key recovery and related key attacks: RC4 used to "sign" a nonce: 3 byte nonce concatenated with 16 byte long term key > RC4 ...
HANGOBA's user avatar
  • 21
0 votes
1 answer
282 views

Background: TEA uses a 128 bit master key $K_{0\ldots3}$. All odd rounds use $K_0$, $K_1$ as the round subkey, and all even rounds use $K_2$, $K_3$. One cycle of TEA applied to the block $A_i$,$B_i$ ...
Confused about Curves's user avatar
2 votes
0 answers
68 views

Given $n$-bit block cipher $E$ (and its inverse $E^{-1}$), define block cipher $E^\prime_k(m) = E_k(E_{f(k)}^{-1}(m))$ where $k,f(k) \in \{0,1\}^n$ and $\forall k:f(k) \ne k$. Under the ideal block ...
forest's user avatar
  • 16.1k
0 votes
0 answers
43 views

Game: Users stack blocks to form an unstable tower. Each time a new block is successfully laid, the game creates a score_string which is meant as proof of the user's current score. Assume each user ...
James Moffet's user avatar
2 votes
1 answer
475 views

On Wikipedia's Related Key attacks page, there is a section about WEP as an example to related key attacks. Encryption uses the RC4 algorithm, a stream cipher. It is essential that the same key never ...
kelalaka's user avatar
  • 50k
0 votes
1 answer
775 views

The original Schnorr signature scheme suffers from a Related Key Attack (RKA) as described by Morita et al. The authors of this paper then suggest a modification to the signature algorithm to prevent ...
YGrade's user avatar
  • 33
3 votes
1 answer
131 views

I've been reading many papers on boomerang/rectangle attacks. The general strategy is to find two trails for a small number of rounds and then concatenate them to form a longer distinguisher. ...
tcapwasraw's user avatar
0 votes
1 answer
92 views

I dont know is this question more like reverse-engineering or cryptographic. Why governments are hunting for encryptions keys? Aren't they delievering by the network the same as the encypted messages? ...
chill its hvh's user avatar
1 vote
1 answer
671 views

There are lots of attacks which are on reduced block ciphers. There are practical attack on five rounds of AES-128five rounds aes broken in six minutes. I was just wondering if there is any practical ...
Radium's user avatar
  • 187
2 votes
1 answer
566 views

From the Salsa20 security document, DJB states that he doesn't care about related key attacks: The standard solutions to all the standard cryptographic problems—encryption, authentication, etc.—are ...
forest's user avatar
  • 16.1k
3 votes
1 answer
275 views

Background I am currently writing a password manager application. As usual, the passwords are put in a file encrypted using a user-entered password. I'm using the NaCl library but actually it's not ...
Zaphod's user avatar
  • 55

15 30 50 per page