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.

Filter by
Sorted by
Tagged with
1
vote
1answer
76 views

Online AES Calculator

I am currently looking into how AES works and found a calculator online: http://testprotect.com/appendix/AEScalc I understand that the AES process has 10 rounds of calculations. Does this mean that ...
1
vote
2answers
85 views

How to minimize AES output size?

I work on a project about CAN bus and I want to encrypt the data among nodes but I have have a problem because CAN bus nodes receive and send 8 bytes among each others and I know the size of AES ...
1
vote
1answer
72 views

Why is this DES key considered weak?

I understand the premise of weak keys in DES and cryptography. From searching online, I understand that keys that are comprised of all zeroes / all ones / alternating ones and zeroes / alternating ...
1
vote
0answers
16 views

Is it possible to crack AES-256 ECB when provided with the ciphertext and a portion of the corresponding plaintext? [duplicate]

AES-ECB encrypts the message by breaking it into blocks and encrypting them one by one. Provided the knowledge of the ciphertext, a portion of the plaintext that corresponds to a block in the message, ...
2
votes
0answers
25 views

Does anybody have test vectors for the LBlock block cipher?

LBlock is a lightweight block cipher with 64-80 bits block-key size, designed by a group of Chinese scholars. Does anybody have LBlock test vectors? I am looking for test vectors, which contain the ...
2
votes
1answer
66 views

Complexity of Boomerang Attack on COCONUT98

I am trying to understand the paper The Boomerang Attack from David Wagner. On page 162 about complexity of boomerang attack the paper says that: The attack requires $8 \cdot 2 \cdot 32 \cdot 2^{32} ...
0
votes
0answers
18 views

Want to implement a cipher efficiently on Hardware with verilog, is there any standard resources to start?

I want to implement a new block cipher on hardware. The cipher has a look-up table and the rounds are not self-similar. So, the code size, as well as the chip area, is expected to be larger. I just ...
2
votes
1answer
50 views

How to use sagemath to find nonlinear invariants of S Box

I read a paper about a nonlinear invariant attack that is "Nonlinear Invariant Attack: Practical Attack on Full SCREAM, iSCREAM, and Midori64" And i found a website of sagemath : https://...
1
vote
0answers
85 views

Vulnerability in DES3 when key can be chosen

In the question there are two functions encrypt basically does IV ⨁ DES3(P⨁IV) and encrypt_flag just encrypts the flag after being padded into a multiple of 8. IV is a random 8 byte number which is ...
0
votes
1answer
41 views

Does XORing a random block into a layer of CBC encrypted message add some bit strenght?

Let's suppose I encrypt a message with a block cipher in CBC mode, keep the key and IV secret and XOR a random block of data in each encrypted CBC block, being the XORed block the same for each CBC ...
0
votes
0answers
27 views

How do I preform the inverse key expansion of aes decryption? [duplicate]

I’m working on an aes encryption and decryption project in 8086 assembly! I managed to code an encryption algorithm and it worked perfectly. No I’m working on the decryption algorithm. I’ve managed to ...
1
vote
1answer
31 views

Quadratic Equations to Describe SBox

I am using a 8 bit Sbox having 16 entries with a lookup table of 4x4 in cryptographic algorithm. Sbox is constructed on subgroup of galois field 2^8. I want to calculate number of quadratic equations ...
0
votes
1answer
84 views

Security Analysis

I have designed my own lightweight cryptographic algorithm and now measuring its security. I was finding bounds on probabilities against linear and differential attacks. For differential ...
1
vote
1answer
36 views

How to prove the pseudorandomness of CryptoPAn

in my cryptography course, we are learning about pseudo randomness and the prefix-preserving function known as CryptoPAn invented in 2002. It is said that the scheme is highly insecure. So in that ...
0
votes
0answers
37 views

Random Oracle Model for an ideal block cipher vs Ideal Cipher Model

Some security proof involving an ideal function use the Random Oracle Model (ROM). They posit a thing that given integer $b$ and bistring $M$, returns what it previously returned for that input $(b,M)$...
1
vote
1answer
63 views

how can identify which cryptanalysis is used ( Indistinguishability cryptanalysis against classical ciphers) [duplicate]

I have 10 ciphertexts and 10 plain texts I want to know which cipher is from which plain text how can I know this I know the name of substitution cipher, transposition cipher, Vigen`ere cipher and ...
0
votes
0answers
46 views

Number of false keys in exhaustive key search for block ciphers

I'm doing a self study through Understanding Cryptography by Christof Paar and I have a question about Theorem 5.2.1 in the book: Given a block cipher with a key length of $k$ bits and block size of $...
0
votes
2answers
98 views

AES plaintext is smaller than 128 bits [duplicate]

I'm currently developing a AES implementation in a graduation project at university. As far as I know, AES uses a 128 bit block length as input . if the entered string to encrypt is not 128 bits such ...
1
vote
1answer
509 views

How does using a really small block size reduce the key space?

I read this online and was confused: Modern block ciphers tend to have block sizes of 128 bits or larger, because if the block size is too small there is the same problem as a small key space as ...
3
votes
1answer
70 views

Number of plaintext–ciphertext pairs needed to rule out false keys with a reasonable likelihood in AES

I am new to cryptography and I've got the following question from Understanding Cryptography: Imagine that aliens — rather than abducting earthlings and performing strange experiments on them — drop a ...
1
vote
1answer
55 views

1:1 algorithmic shuffle of massive numerical space

For a personal project I'm currently tinkering on, I'm looking for a function which has the following properties: For any number X in the range 0..MAX, there is a 1:1 random mapping with another ...
1
vote
0answers
57 views

Proving Security of a Tweakable Block Cipher in CBC Mode (Threefish)

I want to prove the security of a Tweakable Block Cipher in CBC Mode How does one prove the security of a Tweakable block cipher (ie Threefish) in CBC mode with a random IV and a constant (public) ...
2
votes
0answers
39 views

LibTomCrypt Documentation on LRW Mode/Tweakable Block Cipher - Apparent Contradiction?

In the LRW mode discussion on page 34/161 of the LibTomCrypt manual, available here for example https://opensource.apple.com/source/CommonCrypto/CommonCrypto-55010/Source/libtomcrypt/doc/...
1
vote
1answer
66 views

Listing first 8 bits generated by LFSR

Consider the primitive polynomial P(x) = x^4 + x^3 + 1, initialized with the bit string (shifting occurs from left to right, were the right-most bit represents the LFSR output): 1101. List the first 8-...
0
votes
1answer
41 views

IND-CCA insecurity of modified CBC encrypt + MAC scheme

I've been puzzling over the following proof for the past couple of days. Since a block cipher in CBC mode can be used to build both an IND-CPA secure encryption scheme and a EUF-CMA secure block, a ...
0
votes
1answer
67 views

Finding Multiplicative Inverse In Field

Consider the finite set Z_257 of non-negative integers less than 257. The number 257 is a prime, so Z_257 forms a field with addition and multiplication mod 257. How can I use the Extended Euclidean ...
0
votes
0answers
69 views

OpenSSL DES encryption for KCV calculation

I'm trying to implement a simple command-line tool to calculate the (Key Check Value) KCV of some encryption keys. The algorithm for the KCV is simply to encrypt a block of 8 zeros with DES and get ...
2
votes
2answers
83 views

Question on the CPA-security proof of the CTR-Mode

While reading Katz & Lindell's textbook (2nd edition) I found a proof for the CPA-Security of CTR-Mode. It can be found at the end of chapter 3.6.2 (page 93 and 94). I don't quite understand, why ...
3
votes
1answer
70 views

Backdoor Designer Key Recovery in LowMC-M

The paper https://eprint.iacr.org/2020/986.pdf proposed a framework for embedding a malicious backdoor in LowMC cipher, that will later help the designer to recover the secret key in the known-...
2
votes
0answers
57 views

Is there any way to encrypt the path in between a small number of 3D positions?

Or more general: given two valid random cipher $c_0, c_1$ a function $D$ with $$D(c_0,c_1) = (a,b,c)$$ should exist but hard to compute (for most cases). The result $(a,b,c)$ represents the path from $...
1
vote
2answers
104 views

Hashes as mutually independent keys

For cascading encryption (ie. AES-Twofish-Serpent), the most secure implementation is with mutually independent keys. My question is if it is secure to hash the previous key for each layer of ...
1
vote
1answer
71 views

Is AES strictly speaking a SP network?

Forgive me if this seems like a trivial question. I've read that AES is a SP network. However, when reading about P-boxes in SPNs they say that they simply shuffle bits around. In AES the ShiftRows ...
0
votes
0answers
35 views

nonlinearity and autocorrelation of common s-boxes

I cannot find publications comparing the properties of popular cipher s-boxes. First of all, I am interested in nonlinearity and autocorrelation of s-boxes, which are used in seed, cast-128, camellia ...
0
votes
1answer
42 views

Can we design a block cipher based on SP-network without loss of E/D similarity theoretically?

I understand what SP-network (Substitution-Permutation Network) and Feistel Network look like. And those ciphers based on Feistel (e.g. DES) often achieve so called E/D similarity, which indicates ...
2
votes
1answer
64 views

Is there any block-cipher, format-preserving or similar encryption method with known cycle size? (without short-cut, with known source/runtime vars)

E.g. given a $n$-bit message $m_0$ and an encryption function $f$ After applying the function $c$ times it will result in $m_0$ again. $f^1(m_0) = f(m_0) = m_1$ $f^2(m_0) = f(f(m_0)) = f(m_1) = m_2$ .....
0
votes
1answer
43 views

Can a broken cipher reveal the key?

Suppose I cascade cipher A and cipher B to encrypt a message. Both ciphers use the same key. I know that theoretically, the security of the setup when used correctly is at least as secure as the most ...
3
votes
2answers
522 views

AES-CBC decrypts to wrong output?

Someone I know showed this to me, and I can't put a finger to why it's happening. Am I missing something? They encrypt the text, and the output is really guessable. $u\to t$, $i\to h$ (it's one letter ...
4
votes
1answer
112 views

Division property table of SBox

In Table 12 (page 23) of the GIFT paper, the "Division property" table is given. I could not understand how it has been computed. My questions: May I have an algorithm on how to compute the ...
1
vote
1answer
79 views

Where is the SIV in AES-GCM-SIV?

This is my understanding of Synthentic IVs You have 2 keys $K_1$ & $K_2$. $F$ is a PRF Instead of choosing a separate IV, you instead generate the IV from the PlainText. $IV = F(K_1, m)$ $c = E(...
2
votes
3answers
179 views

Can anyone explain to me the difference between the OTP (one-time pad) and Vernam Cipher?

I heard they are very similar, although there are subtle differences between the two.
0
votes
0answers
262 views

Is ECB mode more suitable than CBC mode while encrypting a long bit string?

I know that ECB is less secure than CBC, but will it be suitable for encrypting a long bit string?
1
vote
2answers
52 views

Decryption formula of Plaintext Block Chaining (PBC) mode of a block cipher

Considering that $C_n = E_k(M_n) \oplus M_{n-1}$ formula is used in encryption side of this mode of block cipher, and knowing that instead of M0 a randomly chosen initialization vector (IV) is used in ...
1
vote
1answer
33 views

How are keys mapped to cipher texts in block ciphers with large block sizes?

What I understand so far: For n-bit block size, there are 2n plaintexts (P) there are P! possible keys The bits necessary to represent each of the possible mappings is log2(P!) rounded up Basically, ...
2
votes
1answer
73 views

How are SHACAL-2 ciphers calculated?

I am trying to learn about the underlying functionality of the different hash functions (currently SHA) and I'm pretty stuck even after watching a Stanford video about it. One method of hashing is by ...
9
votes
0answers
192 views

How many additions modulo $2^k$ and multiplications in $\mathbb F_{2^k}$ are needed to resist cryptanalysis?

Consider a $k$-bit block cipher with $r$ rounds, and key composed of $r$ subkeys $K_i\in\{0,1\}^k-\{0^k\}$ (that is, non-zero $k$-bit bitstrings), for $i\in[0,r)$. Plaintext is $P=S_0\in\{0,1\}^k$, ...
0
votes
0answers
40 views

Looking for encryption function given decryption function (2048-bit ciphertext and key, addition and subtraction operations)

I have a decryption algorithm for 256-byte (2048-bit) blocks and want to find the matching encryption algorithm. What I know about the algorithm and have: 256-byte ciphertext (I have multiple ...
12
votes
2answers
4k views

Why don't we use Blowfish if it hasn't been cracked?

Since Blowfish is old, well-audited, and has no published attacks, why are we using AES instead? I know that Bruce Schneier said that Blowfish is insecure and told people to transition to Twofish, but ...
0
votes
0answers
78 views

Mathematical and empirical analysis of AES

Hello everyone and happy new year in advance. I'm doing a work about the analysis of the AES algorithm, and I have some doubts about this. First, I need to do the mathematical analysis of the ...
1
vote
0answers
33 views

How is it possible to prove that Shanon entropy does not change applying any bijective function to X? [duplicate]

I was wondering how is it possible to mathematically prove that Shannon entropy does not change when applying any bijective function to X? For instance H(X) = H(f(X)) assuming that f is invertible and ...
1
vote
0answers
52 views

Usage of block and stream ciphers

I see that in many applications stream ciphers are common than block cipher - whether is Salsa20, AES-GCM, etc. In which cases would a stream cipher be preferred over a block cipher and vice versa? ...

1
2 3 4 5
19