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”).

learn more… | top users | synonyms (1)

3
votes
0answers
75 views

How to overcome issues with big ciphers? E.g. with small vs. big Vigenére Ciphers

I understand that bigger ciphers show more recurring patterns and therefore should be easier (or at least faster) to decrypt as you'll have a better statistical analysis, being However if we use a ...
5
votes
1answer
423 views

Small subgroup confinement attack on Diffie-Hellman

I am trying to understand the small subgroup confinement attack on the Diffie-Hellman algorithm. I will present the attack and try to explain why it works. Small subgroup confinement attack on the ...
0
votes
1answer
102 views

How secure is this modified Bazeries Cylinder?

This device is a modification of the Bazeries cylinder, it has two stacks of 5 rotors which each bear two alphabets plus numbers 0-9, one in correct order and one in random order ( 36 characters in ...
2
votes
1answer
496 views

The Boneh-DeMillo-Lipton fault attack (RSA CRT)

I am trying to understand the Boneh-DeMillo-Lipton fault attack on RSA CRT signature. Suppose that we sign a message $m$ with RSA-CRT : $d_p = d \bmod (p-1)$ and $d_q = d \bmod (q-1)$ $s_p = h(m)^{...
1
vote
2answers
52 views

Using what we already know about the data to decrypt it?

Are there any methods or tools out there that let us use what we know about the data in order to crack the encryption? For example let's say I get access to an encrypted database file but I know ...
0
votes
1answer
63 views

Is AES-CTR or ChaCha20 vulnerable to a time-memory trade off?

Is AES-CTR or ChaCha20 vulnerable to a time-memory trade-off attack? According to this paper it seems to be, which would put AES-CTR at a clearly breakable $2^{64}$ security level (for AES-128-CTR). ...
1
vote
3answers
105 views

Will the contents of a password protected Zip 2.0 file be safe for a week

I will need to distribute a file to people for a challenge and I need them to open the file at the same time. The file will be provided a couple of days before the challenge. For maximum compatibility ...
2
votes
2answers
95 views

Linear cryptanalysis complete key guessing

In linear crypt analysis, partial sub keys are guessed and verified for its correctness with the help of plaintext and ciphertext. From the partial sub key, how it is possible to guess the complete ...
2
votes
1answer
73 views

Trusted Third Party Cryptanalysis Labs?

There's no doubt that third party cryptanalysis is an essential part of the crypto ecosystem. It's how we know that there's some degree of practical "goodness" to a new algorithm or protocol. Unlike ...
1
vote
1answer
86 views

How to encrypt and decrypt a transposition cipher?

I encrypted the text hello there with a 3x4 table with the key 2 1 3. I fill in the text into the table row by row and got the ...
6
votes
1answer
283 views

Is it possible to find a Mersenne Twister seed given only the first output?

Suppose I have a Mersenne Twister seeded with some unknown value, and I’ve been given the first output. Given only this first output, and no other information, is it possible to derive the unknown ...
1
vote
1answer
61 views

What is the advantage of Pseudosquare?

Pseudosquares ,which are not square but Jacobi symbol are still 1, are used in some cryptographic algorithm. What is the advantage of them over the exact squares? If we used squares instead of ...
4
votes
3answers
5k views

Is javascript RSA signing safe?

I'm currently working on a secure open source messaging system (https://github.com/DSMNET/DSMNET). I'm currently using the cryptico.js (https://github.com/wwwtyro/cryptico) library to encrypt all the ...
58
votes
4answers
11k views

Why does the FBI ask Apple for help to decrypt an iPhone?

The current debate of the FBI trying to get Apple to assist in decrypting an iPhone made me wonder: Normally, upon turning on an iPhone, everything is decrypted using a 4-digit pin (or actually, a ...
0
votes
1answer
21 views

CCA on PKCS#5 using error feedback

My question is about attacking PKCS#5 with CCA using the error feedback. What we learnt in class about PKCS#5: CBC requires padding to whole block boundary PKCS#5: standard padding If ...
1
vote
1answer
59 views

Difference of full codebook and non full codebook

While reading a paper about Dynamic cube attack, I saw two terms: full-codebook and non-full-codebook attacks. What do they mean? What is the difference? Regards
1
vote
0answers
39 views

Can error correcting codes be used to guess this plaintext?

I pick a finite set of messages, perhaps the set of integers $M = \lbrace n \in \mathbf{Z} \, : \, 0 \leq n\lt10 \rbrace$, which you are then allowed to encode in any way you want (some form of error ...
4
votes
1answer
479 views

Why is it a bad idea to use a UTF-8 derived symmetric key?

Given a cryptographically secure series of octets, it is often useful to display this information or store it in a database in a textual format such as hexadecimal. Why would it be incorrect to take ...
1
vote
2answers
131 views

How to identify the difference between two cryptographic schemes in terms of security?

I am currently working on a project, that requires using encryption libraries namely (LibScarab and FHEW). I want to know how can I compare the two schemes in terms of security (I already compared ...
0
votes
2answers
77 views

Detecting Encryption in Real-Time

Is there anyway to detect encryption in real-time through a common signature or pattern recognition. Say, a file is being encrypted using an AES-256 cipher, if I have access to the file stream - can ...
5
votes
1answer
228 views

Why $e>n^{3/2}$ prevents Wiener's attack

Here's the Wiener's attack as I understand it. Suppose $n=pq$ with $q < p < 2q$, and $d < n^{1/4}/3$ where $ed=k\phi(n)+1$ and $e < \phi(n)$. $$\begin{align*} n-\phi(n) &=n-(p-1)(q-1)...
4
votes
1answer
97 views

Exposed raw RSA private key operation

Assume that there is a smartcard or other hardware token that exposes the raw RSA private key operation (modular exponentiation, with or without CRT parameters). Is there any possibility that raw RSA ...
0
votes
0answers
41 views

autocorrelation and entropy of historical ciphers

I'm learning cryptography and come across historical ciphers such as vigenere cipher,hill cipher,random substitution and etc.I'm using cryptool for learning purposes and I have a question in mind.I've ...
0
votes
0answers
10 views

calculating n-gram lists and spaces in ciphertext

I'm doing an analysis on a block of ciphertext message with 27 characters(including spaces).Now do the spaces need to be taken into account when performing the digram and trigram analysis?because the ...
3
votes
1answer
130 views

Image sharing without data overhead

The idea is to share $n$ images among $n$ persons so that all images can be reconstructed by someone in possession of all shares. However, there must not be any data overhead (which means the shares ...
1
vote
1answer
56 views

How would multiple uses of a vigenère cipher be decrypted on paper (classic)?

As far as I can tell (from reading the Wikipedia article about it) decrypting a message encrypted with the vigenère cipher is possible on paper. But what would happen if the message is encrypted ...
7
votes
2answers
426 views

Given enough RSA ciphertext, is it possible to determine which key was used?

Given enough RSA ciphertext, is it possible to determine which public key was used to generate the ciphertext? Presume an unknown public key that was used to generate RSA ciphertext, and we have ...
16
votes
2answers
2k views

Why is Pearson hash not used as a cryptographic hash?

The original algorithm produces 1 byte long hash and is (of course) not suitable for cryptography use. But according to wikipedia, it is possible and easy to produce Pearson hash of any length, ...
1
vote
1answer
61 views

Testing implementation of cryptography algorithms: Brainstorm

I wonder what kind of techniques can be used to validate implementation of cryptography algorithms? The obvious one is to run specific algorithms against publically known test vectors (i.e. from ...
1
vote
1answer
101 views

Whether this PRG is secure or not

This is the question. Suppose $G$ is a secure PRG with expansion factor $\ell(n) = 2n$ such that $n$ is a security parameter. Is it always the case that, $G'\colon \lbrace 0,1 \rbrace^n \to \lbrace ...
9
votes
1answer
411 views

Given enough RSA signature values, is it possible to determine the public key value?

Given enough RSA signature values, is it possible to determine which public key is required to verify the values? Could there be enough information to establish which key is required? Is there ...
0
votes
1answer
101 views

How is injective, inverse, surjective & oneway related to cryptography?

Just researching cryptography concepts and finding it really hard to absorb them. I would love to know how these functions (injective, inverse, surjective & oneway) are related to cryptography. ...
1
vote
0answers
70 views

Differential bound of the S-Box in GOST R34.11-2012

In Russian GOST R34.11-2012 LPS-transformation is used. LPS gets all of its non-linearity from the 8-bit S-box S, which apparently has been designed to offer resistance against classical methods of ...
1
vote
2answers
612 views

How many oracle calls to break an affine cipher in a chosen plaintext attack?

Assuming the ability to launch Chosen Plaintext Attacks (CPA), how many oracle calls does an attacker need to break the affine cipher? How does it work?
3
votes
1answer
67 views

Affine cipher and plaintext attacks, how to find the base modulo?

Last year, a question concerning plaintext attacks was posted at Mathematics.SE: “Plaintext attacks: affine cipher”. I have no problem to see how to solve it when we are given two ciphertexts and $(...
0
votes
0answers
19 views

Problem with braking SASAS type of encryptions

I am reading the paper Structural cryptanalysis of SASAS. I understood it till the section Recovering of layers S1 and S3 on page 6. However because of my limited understanding of mathematics, I am ...
1
vote
0answers
50 views

Is it possible to create a detection oracle for all block cipher modes? — ciphertext-only cryptanalysis

I have made an ECB/CBC detection oracle, and am now trying to make a detection oracle that can differentiate between CBC/CFB/OFB/CTR/etc. I can already tell ECB apart from the others due to this ...
1
vote
1answer
435 views

Decrypting an Affine Cipher with known characters

I am trying to cryptanalyse multiple cipher–texts that I know are encrypted by different Affine ciphers. I have already analysed the frequency that each character occurs, and compared it to a ...
-1
votes
1answer
462 views

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312. Just some guidance/help with this problem would be greatly appreciated not sure how to ...
1
vote
1answer
813 views

Cryptanalysing Affine cipher

I am trying to cryptanalyse a cipher–text encrypted by Affine cipher. The encryption formula is: $c = f(x) = (ax+b)\bmod m$, where $a$ and $b$ are unknown constants; $x$ is a plain-text symbol, and $...
-2
votes
1answer
85 views

How to XOR two hex values and am I doing crib dragging correctly? (OTP)

Let's say I have the two cipher texts 7ECC555AB95BF6EC605E5F22B772D2B34FF4636340D32FABC29B 73CB4855BE44F6EC60594C2BB47997B60EEE303049CD3CABC29B According to this website http://xor.pw/? the result ...
2
votes
1answer
64 views

Distinguishing two sets of pseudorandom values when their keys differ by one

Suppose we use a pseudorandom function $PRF$ and a random key $k$ to generate a set of pseudorandom values: $\forall i, 1\leq i \leq n: w_i=PRF(k,i)$ Now, consider instead of picking a fresh key, ...
0
votes
0answers
11 views

Calculating inverse of transposition key cipher [duplicate]

I need some help on transposition cryptography. If I'm given the encoding key to a transposition cipher, how do I get the decoding key for it? I tried googling but couldn't find any steps on the ...
0
votes
1answer
41 views

Attack being kind of completely puzzled?

I am reading this paper "The security of Hidden Field Equations (HFE)" and at the end of the page 4 the author wrote: Thus, after all, this belief about every attack being kind of ”completely ...
3
votes
1answer
136 views

Relationship between exponent and modulus in RSA (as RSA properties as listed in X.509)

In one of my assignments, I had the following question (Please read on. Not a homework assignment :) ): X.509 (1998 version) lists properties that RSA keys must satisfy to be secure. One such ...
0
votes
1answer
51 views

Mathematical Proof for Key independence in Differential Cryptanalysis

How would you construct a proof that XOR difference of two cipher texts cancels the influence of the key? I started out with a simple cipher defined as follows: $C = \Phi( S(P\oplus K_{0}) \oplus ...
2
votes
2answers
203 views

How to decode a (Vigenère?) substitution cipher? [closed]

I am trying to decode a message that I suspect has been encrypted with a Vigenère cipher: Utl zluuocp zsc rvzu hbcp ztvibfz vrabzz utl ilry. Utlal flal cb fbaiz, qszu zbsciz. Utvu cllihl vhzb dvil ...
3
votes
1answer
400 views

How do you test the security of your cipher?

I got asked this question and I didn't know what to answer. How do you test the security of your cipher? What comes to my mind now would be to test it with famous attacks: padding attacks, ...
5
votes
1answer
131 views

How to attack RSA-CRT with large public exponent?

Suppose we have $(n,e)$ and the ciphertext $c$ where the public exponent $e$ is of the same length, 1023-bit, as the modulus $n$. It is also assumed that the factors of $n$ are balanced. The message ...