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
30 views

CrypTool RSA Features [duplicate]

I am attempting to manually encrypt a plaintext message (message = MI) using RSA. I receive an answer of: 33,264 and 21,164. When I enter the same plaintext into CrypTool to confirm that my ...
0
votes
0answers
27 views

A few questions regarding the 4-Round AES-Distinguisher (by Gilbert and Minier) and DS-MITM

I am struggling to understand the DS-MITM attack on AES (Original Paper). Especially the 4-rounds distinguisher by Gilbert and Minier (section 3). I get the basic idea that we check exactly on which ...
0
votes
0answers
18 views

Decrypt encryptedKey session key using - AES-128 - PKCS-1#rsaes-kem-kdf2-kw-aes128

I have basic knowledge about how encryption algorithms work such as RSA, AES and so on. I have an XML response encrypted with both AES and RSA. I tried using OpenSSL to decrypt with several steps but ...
1
vote
1answer
71 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
28 views

Differential cryptanalysis to ciphertext-only attacks on xxTEA

In my IOT project, I use the xxTEA encryption algorithm to encrypt my data. I use the same encryption key for all my packets because I don't have the possibility to do a key exchange between Alice and ...
1
vote
0answers
26 views

Need some help with decryption code for monoalphabetic substitution

I am working on decrypting ciphertext in monoalphabetic substitution algorithm. I tried to decrypt using frequency histogram of english alphabets individually. The percentage of these frequencies are ...
2
votes
0answers
53 views

Howgrave-Graham lattice attack on NTRU

I am lookin for a good example to illustrate this attack on NTRU using low parameters but I failed to do that, The attack consist to use LLL reduction on A basis of NTRU Lattice, let us use the column ...
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
26 views

How does a forward search attack work? [duplicate]

I just came across this term “forward search attack” while reading about Interchange key and Session key. The book mentioned that using session key helps to prevent attacks such as forward search ...
2
votes
1answer
63 views

Is a Test Vector feature a Security Hole?

I have a system where a block cipher key (likely AES) is entered via a 'command line' over a serial console, probably as hex. The system has no 'print key' feature, so the key is hopefully 'ingest ...
3
votes
1answer
42 views

Nonlinearity of a Boolean function with odd number of input bits

Highly nonlinear functions are used in combination generators and other stream ciphers. We know that maximum nonlinearity (hamming distance to all affine functions) of $f$ is achieved when $f$ is bent ...
2
votes
1answer
90 views

Verify that a point belongs to secp256r1

I need to verify that the point in this public key ...
1
vote
1answer
43 views

How to determine secp256r1 or secp256k1 is used on the web sites

I'm pretty new at Cryptography (and at Cryptanalysis), but I went to the website Elliptic to try to discover the elliptic curve they use, and I found they use ECDP 256. So, by SEC2 I discovered they ...
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 ...
2
votes
2answers
48 views

Does the diffie helman rachet in double ratchet do anything if one side never replies?

I am a little confused on how this functions so apologies in advance if the question is naive. The way i understand it, the function of the standard sending and receiving ratchets in Double Ratchet is ...
0
votes
0answers
16 views

Few questions about setting up SuperCop primitives

Have a couple of questions about the supercop library. I've refrained from asking this question for a considerable amount of time because every time I thought about asking it, it sounded stupid in my ...
0
votes
0answers
50 views

Cryptographic Principles: Bit-Flipping Attack

I'm working and reading about bit-flipping attack and how to set it up. I just got a question, which I am not sure, how I should answer. Question: 'Why is this easy with a stream cipher but not ...
1
vote
0answers
51 views

Comparison of SNARK-friendly hash algorithms MiMC7, Poseidon, Pederson?

There are some cryptographically secure hash algorithms designed to be efficient for SNARKs, STARKs and FHE. Some of them already implemented in Zcash, Zokrates and circom. The ones that I know of are:...
1
vote
1answer
30 views

Paillier estimate attack costs on short keys

I was thinking about how to use the homeomorphic property of that cryptosystem to achieve not a "semantic security" but a less ambitous obfuscation of the source code (an ipotetical scenario ...
0
votes
0answers
35 views

Difficult to guess the targeted receiver

The protocol is defined as : Bob want to send message to one of his friends say $k$ friends , he does not want his others friends (except one whom he want to send message ) to tell who is targeted ...
0
votes
0answers
26 views

How to find Difference distribution table of DES S box?

I Have used Sage command ...
0
votes
0answers
20 views

I was going through Path ORAM in oblivious RAM. I found it very interesting, as its promising but is there any scope left to enhance it?

Is there any specific field in Path ORAM where I can further investigate or research?
0
votes
0answers
31 views

How do I model this system?

I was trying to work out the security of an system that used the polarized LCD panel over an OLED display (the point being that you can only block certain pixels) and the pixels are either on or off (...
6
votes
2answers
260 views

Examples of Weak Cryptography being exploited in the wild by cybercriminals?

As a theorist, I often motivate the need for strong cryptography via simplistic methods, such as "If this did not exist, your online bank transactions would be vulnerable". This is of course ...
3
votes
2answers
79 views

Using $key^{th}$ multiple of $\pi$ as a one-time pad

With a key $k$ of sufficient length, say 128 bits, is it possible to use $k^{th}$ multiple of $\pi$ as a one-time pad? Please enlighten on the security as well as practical aspects (only if secure of ...
3
votes
1answer
61 views

What are “unspecified” differentials in a differential characteristic?

I've been studying many papers on differential cryptanalysis and I see that in the published differential characteristics, such as in the appendices of [1], [2] and [3], some differences are left &...
3
votes
1answer
76 views

How exactly to concatenate two differential trails to form a boomerang disguisher in practice?

I've been reading many papers on boomerang/rectangle attacks. The general strategy is to find two trails for a small number of rounds and then concatenate them to form a longer distinguisher. ...
-3
votes
1answer
174 views

Can Big Data together with deep neural networks attack RSA by affording the vast calculation of prime multiplications in advance?

This is a spin-off from Can Big Data attack RSA by just calculating many prime multiplications in advance? [duplicate]. Intro I am somewhat new to cryptography. Repeating the basics of RSA from How ...
0
votes
0answers
79 views

Can Big Data attack RSA by just calculating many prime multiplications in advance? [duplicate]

Intro I am somewhat new to cryptography. Repeating the basics of RSA from How are the primes used to generate RSA keys?: Textbooks say the one-way function is merely two primes (with some critical ...
3
votes
1answer
129 views

How does AES bit security increase by round?

As AES progresses through multiple rounds, approximately how does it security increase round by round up to its maximum? I'm curious about the shape of the curve. Is it linear, some kind of ...
0
votes
1answer
57 views

In the reduction proof below, where OWF exists only if is a PRG. I am not able to understand the highlighted part

I am able to understand how G(x) id generated. But then what is the use of variable z. Also if the probability is >1/2 + e then the distinguisher wins! Then how is this still a OWF
1
vote
0answers
50 views

How to prove that the given encryption scheme have ciphertext indistinguishability for all PPT adversaries?

I am not sure how to prove that the given two scheme is perfectly indistinguishable for all PPT adversaries!
1
vote
4answers
255 views

Any famous approach for analyzing the randomness of data?

I'm writing a function that will allow me to analyze the randomness of some input data and return some stats about the probability of this data to be random. Obviously it should be based on two things:...
0
votes
1answer
39 views

Affine Cipher: what to do if the number isnt invertible over mod n? [duplicate]

I am currently solving a simple cryptanalysis problem where I need to decrypt a text file using frequency analysis. The text has been encrypted using an affine cipher over a 68 character alphabet ...
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-...
1
vote
2answers
103 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
0answers
36 views

What is the easiest cipher to use in designing double ciphers?

I want to make a double cipher consisting of two encryption method Enc1 and Enc2, and two corresponding decryption mechanisms Dec1 and Dec2. I want it so that: (1) we can encrypt any message M1 to a ...
1
vote
1answer
64 views

Is this constant-time comparison secure?

I was thinking about constant-time comparison and how it differs from "==", when I thought of a simple way that's could be constant-time. Being a beginner in cryptography, I'd like to know ...
0
votes
1answer
51 views

How does the frequency work with Vigenère Cipher?

So I have an unknown key but with the length of 6. I understand that I calculate my own English letter frequency of my letters. I then compare it with the standard English letter frequency and ...
0
votes
0answers
37 views

Identify encryption scheme - Many-To-One?

What type of encryption is used when the encrypted phrase only uses the letters from a keyword? For Example: Keyword: Stack tkc ska ktkkac skccaasca ckssak This was encrypted using only the letters ...
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 ...
2
votes
1answer
1k views

Potential Service Life of ChaCha20?

I have some very sensitive family files that I want to store in the cloud on multiple providers for maximal reliability and redundancy. It's essentially a large archive of all our family photos, ...
0
votes
0answers
23 views

Fundamentals of XL algorithm

I am trying to understand XL algorithm and F4/F5 algorithms for solving multivariate polynomial systems. Is XL related to the Grobner basis? I would be grateful if anyone could suggest me the topics (...
2
votes
2answers
54 views

How to decode Playfair when only a small part of key is available?

How to decode Playfair when only a small part of key is available? What is the plain text for this message? Can someone explain how to recover the plain text for this message? Is there a program that ...
2
votes
1answer
330 views

Is tagging the hash of a password along with ciphertext secure?

Suppose I have a password, in which I use Argon2ID with 1GB memory to derive an encryption key. Then, I encrypt my data using XChaCha20 using that encryption key. The problem with ChaCha is that any ...
0
votes
0answers
83 views

One-time pad: Using Cribdrag for Decipherment and Key Recovery

I have been given three different strings: ...
0
votes
0answers
44 views

Reversing black box algorithm

I'm trying to solve the next problem: We have X - input vector, its length is 128 bits. Output vector Y, its length 2048 bits. ...
8
votes
0answers
74 views

Do CCM and EAX provide key commitment?

In an interesting paper called "Partitioning Oracle Attacks" by Julia Len, Paul Grubbs & Thomas Ristenpart an attack is presented on 1.5 pass AEAD schemes that utilize GMAC (GCM, AES-GCM,...
0
votes
0answers
27 views

Is there a LPN estimator like LWE?

I recently studied the LPN problem and BKW algorithm for solving LPN problem. Several papers deal with the concrete parameters of LPN to be secure against BKW algorithm, but I cannot measure the ...
3
votes
1answer
95 views

Significance of parameter q in NTRU lattice attack

In NTRU (N,p,q,d), N is usually chosen to be prime and q be a power of 2. Why is it that if I increase the parameter q, the probability of finding a key or spurious key that can decrypt the message is ...

1
2 3 4 5
28