Skip to main content

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.

1 vote
0 answers
66 views

I have a 20 character cipher text that the function f() would decode to a 10 digit phone number ...
Nick M's user avatar
  • 111
3 votes
1 answer
146 views

Given a symmetric key block cipher with an $n-$bit blocklength with $n-$bit key (in ECB mode) let $N=2^n.$ Is there a known time memory tradeoff with $T=M=O(\sqrt{N})$? Edit: Thinking a little further,...
kodlu's user avatar
  • 25.9k
2 votes
0 answers
101 views

I am analyzing a custom 64-bit block cipher implemented as a 4-round SPN. The cipher operates on 8-byte blocks with an 8-byte master key. The S-box, bit permutation, and key schedule are fully ...
Mashal Bhatti's user avatar
4 votes
0 answers
124 views

KeeLoq is a proprietary 32-bit block, 64-bit key block cipher based on an 32-bit NLFSR and 64-bit FSR that is very frequently used for wireless car keys. It clocks its NLFSR for 528 rounds to encrypt ...
forest's user avatar
  • 16.2k
8 votes
0 answers
190 views

I'd like to know if there are any papers which study the North Korean block cipher Pilsung. This block cipher is based heavily on AES, but with a few differences including a new key schedule based on ...
forest's user avatar
  • 16.2k
3 votes
1 answer
195 views

I’ve been exploring a theoretical encryption method inspired by a 3×3 Rubik’s Cube. Conceptually, it works like this: The plaintext is written onto the cube’s faces in some systematic order. For ...
TheCryptoStar's user avatar
1 vote
1 answer
137 views

SM4 is an unbalanced Feistel structure that takes a 128-bit plaintext and a 128-bit key as input and produces a 128-bit ciphertext as output. It consists of 32 rounds. In each round, only 32 bits are ...
preethi's user avatar
  • 913
2 votes
1 answer
244 views

I'm implementing the Bitslice Serpent cipher using the Osvik's S-Boxes in C++. I read this answer which helped me validating my subkeys. However, the key given in the answer doesn't seem to be from ...
Gabriel L.'s user avatar
0 votes
1 answer
127 views

My basic idea was that one can use a CBC mode of operation, with the file's message digest as an IV: The digest could then either be stored somewhere, or chaffed (dispersed) through the ciphertext, ...
GeoMldr's user avatar
2 votes
0 answers
45 views

To my mind, there are two go-to uses for a tweak input for a block cipher or mode of operation: A counter to make each block in a sequence of message blocks encrypt differently. A counter for a ...
Melab's user avatar
  • 4,338
4 votes
0 answers
100 views

PRINCE is a low-latecy 64-bit block cipher designed for/by NXP (I don't know if anyone else uses it). For instance, this dev board FRDM-MCXN947 has the following diagram which shows the internal ...
yoyo's user avatar
  • 607
2 votes
1 answer
86 views

I'm currently reading an interesting paper, "Revisiting Higher-Order Differential-Linear Attacks from an Algebraic Perspective", and I had a couple of questions in Section 4.1, which ...
AJAY KUMAR DAS's user avatar
4 votes
1 answer
672 views

Most block ciphers inject a round key after every round, but Threefish only injects a key every 4 rounds. Which made me thinking: what minimal number of key injections is needed for security? I ...
popel11's user avatar
  • 107
0 votes
2 answers
325 views

I've been working on a project for about a month now, and I'm completely new to the world of cryptography and reverse engineering. I'm just beginning to explore both static and dynamic analysis (with ...
user avatar
1 vote
3 answers
389 views

This question comes from exercise 4.20 of Boneh and Shoup's "Graduate Course in Applied Cryptography [ver. 0.6]:" Let $\pi: X\rightarrow X$ be a permutation, where $X=\{0,1\}^n$. Recall that ...
Nathan Lowry's user avatar

15 30 50 per page
1
2 3 4 5
79