Questions tagged [block-cipher]

A block cipher is an encryption algorithm which encrypts fixed-size blocks of plaintext to same-sized blocks of ciphertext. For good ciphers every bit of the ciphertext block depends on every bit of the plaintext block and every bit of the key.

83 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5
votes
0answers
320 views

Statistical saturation attack on block ciphers

I was wondering if anyone around here could give me some explanation on this type of attacks. Pretty much the only thing that I could find is A Statistical Saturation Attack against the Block Cipher ...
4
votes
0answers
106 views

Aside from Keccak, are there any keyed/unkeyed permutations where the choice of all rotation constants is not based on heuristic methods?

I am interested to see examples of cryptographic algorithms (namely, keyed or unkeyed permutations that transform an $n$-bit input to an $n$-bit output) where the choice of all rotation values is not ...
4
votes
0answers
160 views

Safely using ciphers that take small key sizes

Is it feasible to use triple encryption for block ciphers with the maximum keysize being the only significant security issue? I mean $C = E_{k_1}(E_{k_2}(E_{k_3}(P)))$ and $P = D_{k_1}(D_{k_2}(D_{k_3}(...
4
votes
0answers
183 views

Differential Path Search of a Block Cipher

Camellia Design and Analysis document refers to a paper: [24] M. Matsui, "Differential Path Search of the Block Cipher E2," (in Japanese), Technical report of IE- ICE, ISEC99-19, pp.57-64, The ...
4
votes
0answers
218 views

How secure is $\operatorname{AES256}_{\operatorname{ECB}}(\operatorname{ChaCha20}(\text{plaintext}))$?

Suppose I encrypt a bytestream using ChaCha20, and then encrypt the resulting ciphertext using AES in ECB mode. How secure is the combination?
3
votes
0answers
38 views

Markov ciphers - generalized group operation

I’m reading this paper of Lai and Massey where they give a very nice perspective on differential attacks in general http://www.isiweb.ee.ethz.ch/papers/arch/xlai-mass-inspec-1991-3.pdf They do their ...
3
votes
0answers
65 views

How to decide which diffusion scheme is better for a block cipher design

There are several schemes that can be used to achieve the diffusion property in a block cipher. Schemes include MDS code, Bit permutation, Byte/ Nibble permutation, Diffusion Matrix, Diffusion ...
3
votes
0answers
159 views

Why are cyclic keys in Feistel Networks insecure?

So everyone seems to agree that recurring round keys in a Feistel network (eg. using the same key for every round) are a massive security leak. When researching this, the only thing I found is the ...
3
votes
0answers
100 views

mCrypton - does anyone know where I can find test vectors or a reference implementation?

I am currently writing an implementation of the mCrypton lightweight block cipher (as presented in this paper). Unfortunately, the authors do not provide any test vectors. I tried to contact the ...
3
votes
0answers
142 views

Implement Twofish cipher with 16-bit blocksize?

I've seen implementation of Rijndael cipher with 16-bit blocksize. And I have also tried to implement 16-bit Rijndael cipher by myself with only a little sneak peeking at the example of the ...
3
votes
0answers
173 views

Breaking linear blockcipher - expanding recursive formula

I am trying to break a block cipher that can be defined as follows: We have 12 rounds and at each round we perform the following operation. We split 64 bit data into 2 parts each 32-bits, $\ x_r$ ...
3
votes
0answers
1k views

Are there key collisions in AES-192, AES-256?

Suppose we have a single, fixed plaintext block $p$ of 128 bits. Call the set of all possible 128 bit blocks $B$. We could define fixed plaintext AES-128 as a function $f(k) \to B$ that takes a 128 ...
2
votes
0answers
50 views

Why does the random oracle receive much more criticism than the ideal cipher?

The random oracle model seems to be criticized a lot as lacking practical relevance, making wrong predictions, being programmable, etc. However, I have never heard such criticism about the ideal ...
2
votes
0answers
37 views

Attackability of one-time MAC when using block mode

Consider an encrypted message m which is encrypted with AES-CBC, so in addition to the message there is an IV supplied initially....
2
votes
0answers
46 views

Design of SIMD-implemented cipher

Design of efficient of block ciphers needs consideration of many factors such as register size. i found that some ciphers can be SIMD implemented such as TWINE , SM4 , chacha20 ,SPIX ,and others. ...
2
votes
0answers
48 views

Security of bit shift in Serpent

As far I know, the Serpent cipher is the only cipher that uses legit bit shifts (<<) along with circular left shift (...
2
votes
0answers
365 views

How can I determine the Hill cipher key in this case?

I have been struggling with a Hill cipher problem for many days, without any luck. I have the following ciphertext, which I know is an encrypted excerpt from an Edgar Allan Poe story: ...
2
votes
0answers
67 views

Why commutativity gives an invariant subspace?

In A Generic Approach to Invariant Subspace Attacks the authors defined an invariant subspace as: $$F(u + A) = v + A$$ Where $F:\mathbb{F}_2^n \to \mathbb{F}_2^n$,$u, v \in \mathbb{F}_2^n$, and $A$ ...
2
votes
0answers
413 views

Round function in Feistel

Following situation. We got a Feistel network. And in each round we get following outcome on the left side: $$L^\prime = L_1 \oplus F(K_1, R_1)$$ Is there a possible key to get an unchanged outcome ...
2
votes
0answers
300 views

Problems key AES 128 key from last round key

I have written an algorithm in Python to find the main AES 128 key from the last round key. However, it doesn't work; I can not find back my main key. I know that the general principle is to do $w[i] ...
2
votes
0answers
128 views

How can I identify the linear equations for a block cipher with 4 different s-boxes?

For a block cipher with 4 different s-boxes (each used in an individual round) how can I identify the linear equations? Normally, for ciphers like AES with a single s-box, linear cryptanalysis can be ...
2
votes
1answer
447 views

Cracking a key using a combination of partial keys

As part of a cryptanalytic attack I've carried out, I used a divide-and-conquer strategy to divide the secret key $k$ into several equal-sized partial keys $k = {k_1, k_2, ...}$. The attack works ...
2
votes
0answers
303 views

Bit slice format of 4x4 s-boxes?

I have studied bit-sliced implementation in SERPENT block cipher and I need to use this technique to implement some 4x4 s-boxes. I couldn't find any procedure to obtain bit-sliced format in any paper ...
2
votes
0answers
34 views

Quantitatively measure the private information revealed by a matrix?

Suppose I have a private matrix $A$ that I want to conceal. I do the matrix multiplication $A^\prime =AK$ and $A^\prime$ is public. How can I quantitatively measure "how well" the matrix $A$ is ...
2
votes
0answers
73 views

Why the same characteristics cannot be used to recover all FEAL4 keys

I am trying to understand how differential Cryptanalysis works. Here I read how to use differential cryptoanalysis for cracking FEAL4 cipher. The big gotcha with this process is that you cannot ...
2
votes
0answers
141 views

How well analyzed are giant block length ciphers?

I have heard about ciphers that have a block length of 256 megabytes... That is huge. How well are they understood by the encryption community? I'm referring to PMC Ciphers. Has anyone used such a ...
1
vote
0answers
40 views

Whats the probability a random cipher has a high probability differential?

This is a bit vauge and long winded. Any partial answers or comments/ways to make this more precise would be greatly appreciated. Fix some general structure for a cipher, for example Sbox then ...
1
vote
0answers
35 views

Memory required for known plaintext attack on general block cipher

Consider a block cipher on binary strings of length $k$ and keys which can be any binary string of length $n$. With $k2^n+k$ memory we can store all key/ciphertext pairs for a fixed plaintext and this ...
1
vote
0answers
39 views

Rivest - Time Memory Tradeoff Using Distinguished Points

A while ago, Hellman introduced a time-memory tradeoff for chosen plaintext attack on block ciphers. There is an innovation due Rivest using a concept of 'distinguished points'. I am looking for the ...
1
vote
0answers
33 views

What is the exact algorithm for encryption and decryption with hummingbird-1 cryptography?

I have really googled the entire internet but could not find a clear algorithm for hummingbird-1 cryptography.The problem emerges in the decryption module: What is the initial value of state register ...
1
vote
0answers
32 views

How keeloq keyfob exchange key with receiver in the first place?

After reading a lot of articles and the microship maunal for keeloq IC, I think I understand how the encryption and decrytion works. If I understand correctly, however, the decryption require the ...
1
vote
0answers
65 views

Perfect Forward Secrecy Stream Cipher based on Block Cipher

I'm thinking about ways to encrypt an endless stream of data (e.g. a video or audio feed) in a way, where a compromise of the current internal state of the encryption (e.g. a RAM dump) does not ...
1
vote
0answers
43 views

Are slide attacks effective if the primitive is sandwiched? And key schedule vs. Even-Mansour

Suppose you have a cryptographic permutation consisting of identical rounds, that makes it vulnerable to a slide attack. But if you sandwich it between two XORs of key material. Is it still vulnerable?...
1
vote
0answers
61 views

How TAU function of SM4ni cipher is implemented?

I am trying to understand the SIMD implementation of TAU function of SM4 which is as follows: ...
1
vote
0answers
201 views

If the S-Box is given. How to calculate the affine transformation matrix?

Example using SAGE sage: sr = mq.SR(1, 1, 1, 8, gf2=True) sage: S = sr.sbox(); S (99, 124, 119, 123, 242, 107, 111, 197, 48, 1, 103, 43, 254, 215, 171, 118, 202, 130, 201, 125, 250, 89, 71, 240, 173, ...
1
vote
0answers
38 views

Additive differential probability

I am studying about additive differential probability. And I show a paper that is V.Velichkov et al., The Additive Differential Probability of ARX. I have a question in chapter 5.2. V.Velichkov et ...
1
vote
0answers
162 views

Double encryption : what method is the best?

Given the block-ciphers defined as follows : $1.$ $C=$ $E_{k1}($$E_{k2}$$(M))$ $2.$ $C=$ $E_{k1{\oplus}k2}$$(M)$ $3.$ $C=$ $(E_{k1}(r),E_{k2}(r$ ${\oplus}$ $M))$ where $C$ is the cipher ...
1
vote
0answers
409 views

how to compute Bit Independent Criteria on a 4-bit S-box?

The idea of Bit Independence Criterion (BIC ) was introduced by Webster and Tavares . For a given set of avalanche vectors generated by complementing a single plaintext bit, all avalanche variables ...
1
vote
0answers
54 views

Is it safe to calculate the counter based on the block number in the stream rather than increasing it every write?

I've come to use AES/SIC for my purpose as I want to write an encrypted file and read it back with the possibility to seek (I only need to read parts of it and don't want to decrypt the whole file ...
1
vote
0answers
76 views

Practical application of lightweight block cipher

Are any lightweight block cipher ciphers adopted in real-time? If yes, what cipher and which application?
1
vote
0answers
61 views

Programming Interface: Preparing Key Schedule for Both Encryption and Decryption

Quick question (01): what is the uniform interface for a symmetric block cipher? Is it $(f:k \to k', enc_{k'}:c \to p, dec_{k'}:p \to c)$ or $(f:k \to k_e, g:k \to k_d, enc_{k_e}:c \to p, dec_{k_d}:...
1
vote
0answers
102 views

Maximum number of blocks that can be safely encrypted using a block cipher with a counter

Assume that we have a block cipher with a key size of $\ell_{K}$ bits, a tweak size of $\ell_{T}$ bits, and a block size of $\ell_{X}$ bits. Formally, the encryption of a given block of data is $$E(K, ...
1
vote
0answers
47 views

Upper bound of this derivative of counter mode?

Suppose that: $\boldsymbol{K} \in \{0, 1\}^{\ell_{K}}$. $\boldsymbol{IV} \in \{0, 1\}^{\ell_{IV}}$. $\boldsymbol{I} \in \{0, 1\}^{\ell_{I}}$. $\boldsymbol{X} \in \{0, 1\}^{\ell_{X}}$. $E(K, X): \...
1
vote
0answers
79 views

Using an Even-Mansour block cipher in a tweakable mode of operation

Assume that: $P(X): \{0, 1\}^{\ell_{X}} \rightarrow \{0, 1\}^{\ell_{X}}$. $Q(X): \{0, 1\}^{\ell_{X}} \rightarrow \{0, 1\}^{\ell_{X}}$. $E(K, X): \{0, 1\}^{\ell_{K}} \times \{0, 1\}^{\ell_{X}} \...
1
vote
0answers
147 views

Block Chain Decryption

Given the encryption formula and flow chart for block-chaining. How could I make the decryption version of this? Would it just be everything in reverse?
1
vote
0answers
193 views

Triple DES: Does knowing the plaintext limit my keyspace for brute force?

My goal is to try and decrypt a single 8 byte block of a Triple DES encrypted data block and in doing so discovering the 8 byte keys that were used. This is mostly an academic exercise but could ...
1
vote
0answers
63 views

RIsk mitigation: block cypher vs xor

It sort of looks like to me that there is a kind of risk mitigation in the architecture of block cyphers vs the xor cypher. In XOR, the risk is entirely in the random number generator. The XOR ...
1
vote
0answers
282 views

How well do ARX algorithms preform (in terms of diffusion)?

I have been researching ARX algorithms, but I would like to know how well does ARX (both single or multiple rounds of) provide diffusion compared to an s-box or an SP network. Also, are there any ...
1
vote
0answers
111 views

Given the block cipher compute max PRF advantage

Hey all I'm having a bit of problem with this question. Not sure how to approach it. Any help will be appreciated :)
1
vote
0answers
470 views

Why does xor-ing a second key into the plaintext of a blockcipher not improve security?

Let us assume that we have a very large number of known plaintexts. How can we prove that $c= DES(K1,M \oplus K2)$ offers no advantage compared to DES?