Skip to main content

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

9 votes
2 answers
2k views

This is a speculative question that may be hard to answer reliably. Apologies. According to a Techcrunch article linked here A stunning report in Forbes today detailed that the NSA’s rapidly ...
kodlu's user avatar
  • 25.7k
4 votes
1 answer
113 views

The 1999 paper "The Security of all RSA and Discrete Log Bits" by Hastad and Naslund here states that any block of $O(\log \log N)$ bits where $N=pq,$ of the encrypted RSA output is known to ...
kodlu's user avatar
  • 25.7k
1 vote
0 answers
60 views

I have studying the lattice basis construction on most implementation but i couldn't understand the difference between the scaling of the unknown part of the equation, the part we want to find in the ...
actgroup inc's user avatar
0 votes
1 answer
84 views

Has there been any significant Research and findings on secp256k1 (genus 1) to the Jacobian of a higher genus curve, so efficient Index Calculus Algorithms can be built
Vdog90's user avatar
  • 1
2 votes
1 answer
244 views

I have a multi prime 2043 bit modulus with 8 prime factors, each 256 bit. ...
wizzbud's user avatar
  • 21
4 votes
0 answers
109 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
1 vote
0 answers
35 views

I’m trying to extract and decrypt the Matrix encryption keys stored by Element Desktop. From reading the Rust SDK crates: matrix-sdk-indexeddb stores encrypted crypto data in an IndexedDB named ::...
jafar qolam ali's user avatar
4 votes
4 answers
906 views

All I want to know is if I'm onto something or if I'm onto nothing from an outside perspective. I want to make an "art" project in so the purpose of it is truly relative. My idea involves ...
nsckjsbdkfjdkfncme's user avatar
8 votes
0 answers
181 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
2 votes
1 answer
189 views

In my introduction to cryptography course I only ever did differential cryptanalysis on ciphers which were completly linear. Now I am analyzing a hash function, where I have to propagate XOR ...
David Krell's user avatar
1 vote
0 answers
112 views

Qi Cheng proved that the minimum distance for elliptic linear codes (AG codes for genus 1 curves) is NP-hard (see https://arxiv.org/abs/cs/0507026). Any instance of ECDLP for an elliptic curve $E/\...
Oisin Robinson's user avatar
2 votes
1 answer
350 views

Let's say you are given an ellipitic curve defined over a finite field, with all of its domain parameters well-defined, e.g. the NIST curves. How can we go about defining a mapping between this curve ...
anthony maina's user avatar
2 votes
1 answer
143 views

I am a student working on cryptography and have designed a custom Morse-code–based symmetric encryption algorithm. It converts file data into Morse-coded form, applies key-dependent transformations, ...
Deep Ratanpara's user avatar
1 vote
0 answers
40 views

Summary This is an experimental exploration of using high-dimensional vector spaces and invertible neural networks (INNs) to harden classical encryption against potential post-quantum attacks. The ...
Cal's user avatar
  • 11
2 votes
1 answer
159 views

I am struggling to adjust the code that is used to attack linear recurrence relation with most significant byte of a 32 bit state is known along with other variables, I was able to recover last 24 ...
actgroup inc's user avatar

15 30 50 per page
1
2 3 4 5
111