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
2answers
603 views

Can combining two secure block ciphers be insecure?

Let's say we have two secure block ciphers FOO and BAR. Will a new block cipher built by combining them into a single new block cipher result in any insecurity? $$\begin{align} \operatorname{BAZ}_K(x)&...
0
votes
0answers
131 views

Randomness Testing of Block Ciphers with 256-bit Block/ Key length

NIST explained the process of "Randomness Testing of the AES Candidate Algorithms" in the document. The document explains the generation of 9 datasets for AES candidates with 128-bit block ...
1
vote
1answer
431 views

OpenSSL aes-128-cfb does not produce expected size

I try to implement aes-128-cfb myself for learning. To confirm whether my implementation is correct, I want to verify it with a well-known library such as OpenSSL. But then I noticed something strange ...
3
votes
1answer
79 views

Is there any block cipher which is also a pseudo-random-permutation over the key

As block ciphers are defined as a pseudo-random-permutation over the data (keyed with the key), I was wondering, if there are also constructions for which key and data can be switched and the cipher ...
0
votes
0answers
20 views

Check linear and differential cryptanalysis of a new block cipher [duplicate]

I am developing a new block cipher primitive. I would like to test its robustness against attacks of linear and differential cryptanalysis. Is there a tool to evaluate this using only plaintext and ...
3
votes
1answer
85 views

Good key update algorithms for key evolving schemes

In schemes like SAKE(Symmetric-key Authenticated Key Exchange) , the master keys (used to authenticate parties and generate session keys) are evolving, ie undergo transition $K=update(K)$. What is a ...
0
votes
0answers
121 views

“16-bit DES encryption algorithm”

I need to use encryption software from PSpice for my SPICE model. In a user guide on page 71 they claim to use a "16-bit DES encryption algorithm". According to the wiki DES is using a 64-...
1
vote
2answers
224 views

Is there any cryptographic scheme with block size more than 128 bit

I am asking this question out of curiosity if there are any cryptographic algorithm that has a block length more that 128 bit. I am new to cryptography and I didn't know any. AES 128, 192, 256 all ...
1
vote
1answer
118 views

Are the Serpent Test Vectors incorrect?

I have recently written an implementation of Serpent and was testing it against known vectors to no avail. Using 256-bit key, I compared my encryption to the test vectors located here: http://www.cs....
2
votes
1answer
183 views

Can repeatedly encrypting a message with a secure cipher ever produce the original input like what happens in ROT13?

Lets say we have a message 'm'. We encrypt 'm' using a stream cipher or any other type of cipher with cryptographic security that produces an output equal in length to the length of 'm'. Then if we ...
0
votes
1answer
83 views

Design flaws when designing a MAC-function

Suppose we want to build a very basic hash function like this: $$c_i = h(c_{i-1},x_i) = c_{i-1}\oplus x_i \quad\quad mit \;\; i\geq1, c_0 = \operatorname{IV}$$ Now suppose we'd use this hash-function ...
1
vote
2answers
485 views

RCON for AES 192 and 256

This is question about how many RCON values are used in AES 192 and 256. I read the NIST Publication introducing AES and in Appendix A.2 and A.3 (Key Expansion for 192 and 256-bit keys), only $rcon_1$ ...
0
votes
0answers
38 views

Is $f_N$ in this hash function is Matyas-Meyer-Oseas scheme?

I propose a hash function as following: H is an Merkle-Damgard hash function with a compression function $f: \{0,1\}^{3n} \to \{0, 1\}^{2n}$. Output function $f_N: \{0,1\}^{3n} \to \{0, 1\}^n$. M is ...
0
votes
1answer
170 views

Block cipher modes used in real life

There is a number of block cipher modes, including ECB, CBC, CFB, OFB, CTR and others. After reading "Serious Cryptography. A Practical Introduction to Modern Encryption" by Jean-Philippe ...
-1
votes
1answer
76 views

Are there issues in how cryptography is used in this short code sample?

I want to encrypt some small text files so I can put them online, in non-restricted access (not the best idea, but it's cheap and simple). I know I should use something like Truecrypt instead of this, ...
1
vote
1answer
189 views

Attack against $\operatorname{DESA}_{k,k_1} (x) \underset{\text{def}}= \operatorname{DES}_k(x)⊕k_1$

Problem 5.16 in this pdf, from the book: Christof Paar, Jan Pelzl, Understanding Cryptography 5.16. This is your chance to break a cryptosystem. As we know by now, cryptography is a tricky business. ...
0
votes
0answers
39 views

Block cipher unconditional security under ciphertext only attacks

Does there exist a block cipher which provides security against ciphertext only attacks, which has an unconditional security proof guaranteeing this is true? I know the existence of a provably secure ...
2
votes
0answers
45 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
1answer
81 views

One-time pad with public key changes

Let $k$ by a randomly generated $n$ bit string, and $m$ a $n$ bit message. Then putting $c = m \oplus k$ is the one-time pad and is perfectly secure. Now assume the transmitter and receiver wanted ...
0
votes
0answers
35 views

PRESENT cipher algorithm Big “O” Notation

I am currently doing a research paper on the PRESENT Cipher algorithms and one of the components that I need to include is time and space complexity. I have tried reading academic articles and ...
1
vote
0answers
41 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 ...
3
votes
1answer
130 views

Do ciphers with a key size of 64 bits still have use under very limited attack models?

If we have a very performance critical interactive session, like a video game, running on a trusted platform (video game console). If our goal is to prevent exfiltration of up to date information (...
2
votes
1answer
126 views

Perfect secrecy and block ciphers

Consider a block cipher that encrypts bit strings of length $n$, where the key-space of the block cipher is of size $2^{kn}$, $k \geq 1$. My understanding of perfect secrecy is that a system is ...
9
votes
4answers
473 views

One round of AES-128

Maybe it’s a silly question, I’m interested in the best known/chosen plaintext attack on only one round of AES-128. More specifically, what is the smallest number of known/chosen plaintext/ciphertext ...
3
votes
1answer
242 views

How to find the inverse of a 3x3 MDS matrix

I implemented a block cipher similar to AES. But the reason I can't decrypt is that I can't get the inverse MDS matrix. The MDS matrix I used is a 3x3 MDS matrix on $GF(2^8) \implies GF(2^8)$ like AES ...
1
vote
1answer
65 views

Error during transmission with one plaintext block (Cipher block operation)

I was given a graph like this, and the problem was stated as: if something happens to P2 then only P2 would not be retrieved on the decryption side, and all other P's can be retrieved normally. I do ...
0
votes
1answer
146 views

Proof of probability of weak keys in block cipher

My textbook has the following theorem: Given a block cipher with a key length of K bits and blocksize of n bits as well as t plaintext-ciphertext pairs, the expected number of false keys which ...
3
votes
0answers
41 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 ...
1
vote
0answers
60 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 ...
0
votes
1answer
93 views

How is a block-chain stored?

Background of the problem: I am undertaking a blockchain course at University and I have taken up a case study for blockchain that relates to logistics. The requirements are simple, yet I am confused ...
0
votes
1answer
39 views

Key Reuse in this simple cipher

Consider the following very simple cipher, where, to send length $n$ bit-strings, we randomly correspond the numbers $1, 2, 3, ..., N$ with $n$ bits, so the key is the correspondence between each ...
0
votes
2answers
400 views

How to properly cypher 16 bytes message containing a CRC checksum?

This question arose from a new context under early developments. If cryptographic operations are not well chosen or badly sequenced, please do notice it along your answer or comments: I am a layman in ...
0
votes
1answer
67 views

Block ciphers as secure as AES but immune against cache timing attacks?

This is a question out of curiosity! I really don't know of any other block cipher that is as secure as AES that has a substitution permutation structure and can be used as an alternative to AES to ...
1
vote
1answer
342 views

32bit AES equals to 8bit AES?

I am looking into an article about 32bit CPU/MCU software implementation of AES and there are some weird changes over there. Like shift-rows. It seems that the shift-rows in the 32bit implementation ...
0
votes
0answers
63 views

S-box for byte substitution where the s-box values are multiplicative inverses of 257

The title basically says it. We have a 16 by 16 s-box, $256$ entries total. And the first value is the multiplicative inverse of $257$, so $1 \times k \bmod 257, \space k = 1$. $2 \times k \bmod ...
0
votes
1answer
52 views

How does pairing letters increase the security of a substitution cipher?

Hello can someone help me to understand this : One way to reduce this problem is to increase the size of the cipher alphabet. Rather than considering our cipher alphabet to be just the 26 letters, ...
2
votes
2answers
157 views

Weakness in a CBC-like XOR cipher

A simple symmetric encryption algorithm can be written as follows: Input message M and 64 bit key $K$ Divide M into 64 bit size blocks $B_1...B_n$ Get first block $B_1$ and perform bit-wise $\oplus$ ...
0
votes
1answer
87 views

How to measure brute force speed of a computer for a give cipher with given number of keys for second for a given key space

As I understood brute force attack is measured in number of keys which in turns give time required based on speed of computer It is quite interesting find out how effective an arbitrary computer is ...
3
votes
0answers
83 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 ...
0
votes
1answer
99 views

What happens if the first input block is identical to the key in DES?

In Data Encryption Standard (DES), M is the input message and K is the key of 64 bits size. M is divided into n 64 sized blocks (B1,B2,B3...Bn).
2
votes
1answer
73 views

Is there any way to find out two numbers such that the XOR between them is a given number?

I have the following operation I took from a cryptanalysis I'm performing for a specific CBC encryption where the challenger has provided the key: ...
3
votes
2answers
539 views

Is there a possibility to create a public key block cipher?

Why there is no public key-based block cipher? It is known that the block ciphers are symmetric-key encryption. However, what is the motivation to not design a public key encryption that encrypts ...
2
votes
1answer
112 views

How can I decrypt this kind of variation of block cipher?

I have a block cipher $E$ that is a permutation of $\{0,1\}^\ell$ for key $K\in\{0,1\}^\ell$. $c = E_{K_1}(m \oplus K_1 \oplus K_2)$ for unknown keys $K_1, K_2$ is given. I need to figure out the ...
7
votes
2answers
219 views

How random are permutations generated from Feistel networks with a small number of rounds?

I wrote a toy pseudo-random permutation out of a Feistel network using blake2b. However, looking at the distribution of permutations for small n = 6, it's clearly not uniform unless many rounds are ...
1
vote
0answers
51 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 ...
0
votes
1answer
88 views

How to apply a block cipher to (large) packetized communication when packets can get lost/erased?

In light of current events (Zoom getting strong headwinds for using AES-128 in ECB mode), I was wondering what the general approach is to packetized data encryption, where the packet length (UDP for ...
4
votes
3answers
1k views

Why do people criticize and mistrust the e-voting based block chain?

I am planning to implement an e-voting system based on hyperledger fabric blockchain, however, I came across many criticisms from well-known security experts like Josh Benaloh and others. The problem ...
3
votes
1answer
223 views

A possible error in the book

So I have been reading this book called "Implementing SSL/TLS using Cryptography and PKI" While going through it, this snippet of code got me baffled ...
2
votes
0answers
55 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
2answers
521 views

How do I find out whether a message in CBC has padding?

When a program is decrypting a message encrypted by CBC mode, what does it find out, whether the last bytes of the last block is part of the padding or part of the plaintext? Example: Use CBC mode ...

1 2
3
4 5
19