All Questions
Tagged with symmetric cryptanalysis
44
questions
1
vote
1
answer
77
views
Is a Shift Cipher with Random Insertions Unbreakable?
Imagine an Encryption Algorithm which applies a classic Shift Cipher (also called Caesar or ROT-X) to a text (with only lowercase [a-z] and the space ...
0
votes
1
answer
101
views
How to evaluate the minimum complexity of the key recovery when the success probability p is given？
Since the practical security of a symmetric-key primitive is determined by evaluating its resistance against an almost exhaustive list of known cryptanalytic techniques.
My problem is that could we ...
4
votes
11
answers
9k
views
For Symmetric Cryptography, why is it considered more important to safeguard a key than the function/algorithm for encrypting/decrypting a message?
As stated for the question above here's an analogy:
You are a robber looking for a house to rob with two different scenarios that might occur.
1. You have a key that you know belongs to a house and ...
- 65
0
votes
1
answer
75
views
Safe implicit value validation: $H_k(k \oplus m) \sim H_k(m)$?
$H_k$ is a cryptographic hash function that's keyed using a section of key material $k$ (for whatever definition of "keyed" that's appropriate for the given hash function $H$).
Are the ...
- 814
2
votes
1
answer
264
views
Can I predict CryptGenRandom on my own device?
I have a Windows 10 laptop with an algorithm that creates a random number using the PRNG CryptGenRandom. According to Wikipedia:
Because CryptGenRandom is the de facto standard CSPRNG in Win32 ...
- 221
1
vote
2
answers
85
views
Given $i$ keyed-$PRP$ labels $\ell_{i,x}$ from a $2^{256} \times 2^{256}$ Sudoku (Latin-square), how difficult is it for an adversary to solve?
There's a keyed-permutation I'm playing with, $\ell_{i,x} = \pi_i(x_i)$, which is a bijection $X \leftrightarrow X$, where $|X| = 2^{256}$, and whose evaluations on plaintext inputs $x_i$ perfectly ...
- 814
0
votes
1
answer
193
views
How does AES-CBC encryption achieve non-repeating blocks of ciphertext?
I am very interested in encryption algorithms, especially AES encryption algorithm in symmetric encryption. To this end, I have studied a lot of theoretical knowledge about AES encryption algorithm ...
- 21
5
votes
2
answers
308
views
In a PGP like Application , would compress and encrypt leak information
would compress and encrypt on data comromise security for PGP like application, would it be secure for use in Encrypted Messaging?
I have heard its safe for data at rest encryption , i have heard ...
1
vote
1
answer
303
views
What are the best known cryptanalytic attacks against AES-128 with 9 rounds?
What are the best known cryptanalytic attacks against AES-128 with 9 rounds?
I found many such attacks on AES-192 and AES-256 with 9 rounds, but not for AES-128 with 9 rounds.
Are there any ...
- 67
1
vote
1
answer
351
views
Best attack estimates on AES
The wikipedia article on the Advanced Encryption Standard claims an attack against AES-128 with complexity $2^{126.1}$. The NIST call for proposals for post-quantum cryptography (table on page 18) ...
- 845
5
votes
0
answers
152
views
Resistance to integral attacks by North Korean block cipher Jipsam1
The cipher is a modification to AES and is described on this website:
The only difference between Jipsam1 and AES-256 is the S-box. Whereas in AES the S-box is public and constant, namely
$$
\begin{...
- 15.4k
0
votes
0
answers
29
views
How does a forward search attack work? [duplicate]
I just came across this term “forward search attack” while reading about Interchange key and Session key. The book mentioned that using session key helps to prevent attacks such as forward search ...
3
votes
2
answers
141
views
Using $key^{th}$ multiple of $\pi$ as a one-time pad
With a key $k$ of sufficient length, say 128 bits, is it possible to use $k^{th}$ multiple of $\pi$ as a one-time pad?
Please enlighten on the security as well as practical aspects (only if secure of ...
- 319
3
votes
1
answer
103
views
How exactly to concatenate two differential trails to form a boomerang disguisher in practice?
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. ...
- 63
2
votes
0
answers
62
views
How is the 'Algebraic Degree' calculated in the paper about analysing the white-box AES(Chow et al. 2002) by exploiting internal collisions?
This paper proposed a new attack on the initial white-box AES implementation of Chow et al.
In order to determine the good solution, we use the
particular structure of the function $S_{0}$.
$S^{-1} \...
- 21