Questions tagged [cryptanalysis]

Analysis of individual security aspects of a cipher or algorithm, not the security of a cipher or algorithm in general (which would lean towards “algorithm-design”).

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

Understanding Fourier Coefficient

In Bogdanov's and others, PRESENT: An Ultra-Lightweight Block Cipher, they mention that the S-box in PRESENT fulfill four primary conditions. They denote the Fourier coefficient as $$S_b^W (a) = \sum_{...
0
votes
2answers
34 views
4
votes
1answer
130 views

Reverse Java random seed using 81 calls to nextInt with a bound of 4?

I'm trying to reverse the Java random seed using 81 calls to nextInt(bound) with a bound of 4. I am wondering if it is at all ...
0
votes
0answers
24 views

Differential cryptanalysis for DES reduced to Four Rounds and about S/N

I'm reading the paper "Differential Cryptanalysis of the Data Encryption Standard(2009)" and I was stuck in a certain part while reading it. In chapter 4, they explained about differential ...
0
votes
1answer
117 views

How safe is my method

I'm building a website. I have an API which takes 2 parameters: delete_user(user_id, hash). And there is method to evaluate hash using SHA512: ...
0
votes
0answers
11 views

Scrypt cipher - known vulnerabilities and cryptanalysis? [duplicate]

there is a Scrypt cipher which is used for exmaple by some cryptos like LItecoin for their mining algorithm. I never heared of scrypt. I know eg SHA256 which is well analyzed and considered as secure ...
2
votes
0answers
36 views

what if the S-boxes in DES were “optimal”

if we assume that the s-boxes in DES were optimal. that is for each s-box, every cell in the DDT equals to 4. is there a differential characteristic in a good probability?
1
vote
0answers
40 views

Symbolic computation in finite fields [closed]

What I want to know is how to perform symbolic finite field computations in SAGE math? Such computations are required in building algebraic models for cryptanalysis. To explain this mathematically ...
2
votes
1answer
31 views

A5/2 session key derivation

Let talk about Implementation and performance analysis of Barkan, Biham and Keller’s attack on A5/2. In this paper, mentioned that we need to brute force attack on register 4 ($R_4$) to get keystream ...
0
votes
0answers
22 views

Why is p-value 0 although proportion is higher than threshold?

In the finalAnalysisReport.txt (the result file of NIST tests), there are several columns including P-VALUE and PROPORTION. ...
2
votes
1answer
58 views

At what modulus size does the logjam reduction stage become impractical?

Attacking a Diffie-Hellman exchange with logjam involves a massive precomputation effort once for the group, and then a comparatively simple reduction stage that is necessary to break each individual ...
1
vote
0answers
32 views

How to break transposition cipher? [closed]

how to break a transposition cipher, especially a turning-grille-cipher? For example: $\begin{array}{rrrrrr} T & E &R& E & W& E \\ ...
2
votes
2answers
51 views

Is there practical Attack on A5/1 Cryptosystem?

There are several and several attacks on A5/1 Cryptosystem, but most of them are impractical. In 2008, Elad Barkan , Eli Biham and Nathan Keller release a practical attack on GSM. Is there any ...
0
votes
0answers
37 views

What is degree of state bits and how do i count it?

in the this paper,section 3,autors attack hamsi-256.Also they explain the weakness that are exploited.Im not so good at math,and also not native english speacker, so i dont understand term "degree of ...
1
vote
0answers
43 views

Why is this attack complexity equal that exact number of bit operations?

in the this paper,section 3,autors attack hamsi-256. Im trying to make a parametrized version, so i need to understand how do they estimate the complexity of attack in bit operations,that reads as ...
1
vote
1answer
55 views

Why isn't there a final permutation on SPN-based ciphers?

I am doing some research on differential cryptanalysis. Most people who are familiar with that cryptanalysis technique do know the tutorial from Heys (Heys Tutorial). I came currently to the question, ...
0
votes
0answers
25 views

How to extract the keyword from a mono-alphabetic substitution cipher

I am a beginner to cryptography and I have the following question. I know that to extract plaintext from a mono-alphabetic substitution cipher I can perform shifting the characters by $n$ times until ...
0
votes
0answers
19 views

AES-CTR key reuse attack with same IV and known plain text [duplicate]

this is from an IT Security exercise which my friend and me cannot solve. Given 2 AES-CTR stream-cipher encrypted files Same known initalizing vector Same (unkown) key Same 128bit Counter ...
0
votes
1answer
77 views

Can we retrieve his private key using his public key in ECC?

A paper wallet is the name given to an obsolete and unsafe method of storing bitcoin which was popular between 2011 and 2016. It works by having a single private key and bitcoin address, being printed ...
2
votes
1answer
98 views

What is the difference between PKCS1 v1.5 and PKCS7? Is PKCS7 a superset of specifications in PKCS1 1.5?

I have a requirement wherein we have to verify the PE binaries generated for an aarch64 platform. These binaries are then signed using the opensource sbsign tool ...
0
votes
1answer
71 views

2DES and 3DES against a DES build with complimentary

I saw this complicated question and I am not really sure about it, would appreciate your view on it. Is the following build stronger than 2DES or 3DES with 2 different keys (or even normal DES)? $...
0
votes
1answer
63 views

Is this the right way to implement ElGamal scheme over Elliptic Curves over prime field? [duplicate]

I'm fairly new to Cryptography, especially elliptic curves in general. I learned to do Point Multiplication, Scalar Multiplication and also programmatically implemented them. But I was trying to do ...
4
votes
1answer
198 views

Any speed up methods for finding the index of a random value produced by the Inversive congruential generator?

The Inversive congruential generator produces random values with: $$x_{n+1} = a\cdot x_{n}^{-1} + b \mod P$$ (special case if $x_n=0$ -> $x_{n+1}=b$) starting with an initial value $x_0$ With well ...
0
votes
0answers
24 views

How would you decrypt an affine cipher with only the ciphertext? [duplicate]

If I have only the ciphertext but the alphabet and the value of a and b are all unknown ... how would I go about this? I understand decryption with the key and alphabet, that is fairly easy but if we ...
2
votes
0answers
34 views

Why is it bad to encrypt the same message M with the same key K in both CTR and CBC modes of operation?

It is apparently not good - more precisely it is not secure - to encrypt the same data message M using the same cryptographic K with a block cipher (e.g. AES, but this is not relevant) in both CTR and ...
1
vote
0answers
82 views

Question about RSA timing attack and a Chosen Ciphertext Attack on RSA

I am quite new to the RSA and I have a couple of questions that confuse me. Q1: A Timing attack on RSA can be prevented _____________________________ A. By performing the “square and multiply” ...
2
votes
0answers
70 views

Using Viterbi algorithm to decrypt Vernam cipher

I'm reading a book on cryptography and it mentions the Viterbi algorithm being used to decrypt Vernam cipher if the same key is used multiple times. According to the book the Viterbi algorithm takes ...
0
votes
1answer
90 views

Hashing using asymmetric cryptography

Every now and then, we read that some hashing function has been weakened or broken, but we almost never hear this for asymmetric cryptosystems like RSA or ECC. That's because while asymmetric ...
3
votes
2answers
359 views

What is linearization attack

I know that In cryptography, the linearization attack is a method of cryptanalysis for block ciphers I am looking for an example of linearization attack couldn't find it online Could anyone ...
0
votes
1answer
77 views

Any shortcut to compute the cipher text for AES applied $n$ times to initial message $m_0$? Or compute $n$ for given $m_0, m_n$?

Knowing all AES parameters (including the key k) with $AES(m_0,k)\rightarrow c_0$ $c_0\rightarrow m_1$ $AES(m_1,k)\rightarrow c_1$ $c_1\rightarrow m_2$ ... $AES(m_{n-1},k)\rightarrow c_{n-1}$ $c_{n-1}...
2
votes
1answer
140 views

Any theory about period length for AES applied to itself?

For example AES-128 starting with a 128-bit message $m_0$ and static 128 key $k$ $AES128(m_0,k)\rightarrow c_0$ $c_0\rightarrow m_1$ $AES128(m_1,k)\rightarrow c_1$ $c_1\rightarrow m_2$ ... continue ...
3
votes
1answer
64 views

Security defined with space complexity

My question is about security defined through space complexity. Suppose I have an encryption function $C=E(K,P)$ for which it can be proved (algebraically) that given $P,C,$ the possible keys which ...
0
votes
0answers
63 views

Is it possible to crack the trifid cipher without the keyword?

I was learning about the classical ciphers and was looking up the methods to break them without the keywords and when I searched up "cryptanalysis of the trifid cipher" I couldn't find anything. I ...
0
votes
0answers
80 views

What is the best way to attack enigma without any a priori knowledge about the plaintext?

I know in great (great great great) detail about how they cracked enigma during the second world war. Looking into it, I decided to have a crack at breaking it. I've come apon a single problem with my ...
0
votes
0answers
52 views

Weakness in double encryption [duplicate]

In the "Introduction to Cryptography: With Coding Theory" by Trappe and Washington, in the chapter about DES algorithm the authors say that: "If double encryption is equivalent to single encryption,...
15
votes
1answer
5k views

Why is double encryption that's equivalent to single encryption no better than single encryption?

In the "Introduction to Cryptography: With Coding Theory" by Trappe and Washington, in the chapter about DES algorithm the authors say that: "if a cryptosystem is such that double encryption is ...
0
votes
0answers
33 views

Lineary of Sbox in DES

I'm not a mathematician, and i would like to understand in the most concise way (if possible) why choosing linear S-Box functions makes the DES algorithm attackable. Thanks
2
votes
1answer
57 views

Property of a good cipher system

In the "Introduction to Cryptography: With Coding Theory" by Trappe and Washington, in the chapter about DES algorithm the authors say that: "In a good cipher system, each bit of the ciphertext ...
1
vote
0answers
31 views

Algorithms for solving systems of quadratic multivariate polynomials

What are the best algorithms for solving systems of $k$ polynomials equations where these are quadratic multivariate polynomials on $k$ variables? I've encountered such systems on my research and I'm ...
4
votes
2answers
93 views

Are there ready-to-use software that can try many decryption techniques on a ciphertext, with no information?

Let's say I receive a 1 MB encrypted file, but I get no information about the encryption method, and no password. The only thing I can guess is that the person probably used a weak encryption method ...
2
votes
0answers
70 views

Enhancing Differential-Linear Cryptanalysis

I'm studying Differential-Linear Cryptanalysis, and I'm trying to understand the context from the article Enhancing Differential-Linear Cryptanalysis by Eli Biham et al. There are some difficult ...
-1
votes
1answer
50 views

One way secure DES key transfer to defend against attacker [closed]

I have a question about cryptanalysis. A transmit message to B with radio waves, A use modulator to transmit bytes with radio, B obviously use demodulator. A encrypts and B decrypts the messages ...
0
votes
1answer
54 views

How to break an unknown ciphertext - transposition of some kind [closed]

I've been challenged to crack a code. All I know about it is that is was hand-enciphered, and that it is a transposition cipher of some kind. When I was given it, I started plugging it into my ...
1
vote
2answers
119 views

Most efficient way to crack a monoalphabetic substitution cipher with spacing intact

I've got a cipher I've been challenged to crack by hand. It's a monoalphabetic substitution cipher, and the English spacing is intact, so all of the words are the right size. Is there a more ...
2
votes
1answer
72 views

Building Key Streams from PRNGs

I am reading an intro book about cryptography and the author tries to explain why using pseudo random number generators is vulnerable. Given PRNG equation; \begin{align} S_0 &= \text{seed}\\ S_{...
0
votes
0answers
41 views

In DES : Matsui's notation(LC) vs Biham's notation(DC)

I'm doing linear attack for 8 rounds DES. And I just wondering about the difference between matsui's notation and Biham's notation. In Matsui's paper, numbers bits from 0 to 63 from right to left. In ...
1
vote
1answer
221 views

Understanding LFSR stream ciphers and the content scrambling system

I'm a little confused over how exactly Linear Feedback Shift Registers (LFSR) work, I kind of get it, but not really, can someone help me understand it? I know it XORs bits in a loop against some mask,...
1
vote
0answers
39 views

Finding repeated groups of letters in the Kasiski examination

While doing the Kasiski examination I came to a problem. If there is the following group of letters in the cipher: AA and later on a group AAA is found. Does it count as two repeats or just one? And ...
1
vote
1answer
53 views

Attacks against RC4 when index $i$ is unknown

RC4 uses two 8-bit indices. One, $j$, is key-dependent and secret, and the other, $i$, increments by one for each byte output. The $i$ index is typically considered to be public, but what if the RC4 ...
4
votes
0answers
87 views

Parameters for high density SIS

I am considering the SIS problem of finding $x\in \mathbb{Z}^m$ such that for random $A\in\mathbb{Z}_q^{n\times m}$, $Ax=0$ and $\lVert x\rVert < \beta$ for some $p$-norm and bound $\beta < q$. ...