Top new questions this week:
|
|
This is about the same random ladder algorithm as my previous question. It computes f(g,n,r)=n*g or g^n (depending on the group notation), where g is a generator of a group. Suppose n=5882353. This ...
|
|
When I searched Google, the top result said
On average, processing for ECC is about four times less CPU-intensive than for RSA.
Yeah, but under what condition? The page says "A 256-bit EC ...
|
|
The problem
We are given a set of $n$ values in $V$. $V$ was made by shuffling (permuting) a sequence $S$ generated by an LCG $\text{G}(a,b,m,x_0)$ where $a$,$b$,$m$ and $x_0$ are all unknown.
...
|
|
Pseudorandom correlation generators (PCG) exist for tensor products, this is described in Figure 1 of [1]. Basically we want party 1 to hold $(x_0, z_0)$ and party 2 to hold $(x_1, z_1)$ such that $...
|
|
I am currently learning about lattice-based cryptography and, reading from A Decade of Lattice Cryptography by Peikert, specifically section 2.3, it emerges that
[...] if the parameter s is greater or ...
|
|
As per my understanding AES introduces diffusion in each block it encrypts even with ECB as mode of operation. If that is the case how the patterns are retained in each block?
In this blog https://...
|
|
I am trying to understand how the forgery attack works when using the CBC-MAC Algorithm
If I have an authenticated plaintext message and a mac tag ($p_0$, $t_0$) and another authenticated plaintext ...
|
Greatest hits from previous weeks:
|
|
I'm trying to understand how the AES S-Boxes are calculated. I understand how the multiplicative inverse is calculated over $GF(2^8)$, but I'm confused by the description of the affine transformation. ...
|
|
The diagram below illustrates the process of digitally signing a message with RSA:
As diagram shows, the message is first hashed, and the signature is then computed on the hash, rather than on the ...
|
|
For example, in RSA, we use this for encryption: $ciphertext = (m^e \mod n)$ and for decryption.
If our message is "hello world", then what number do we have to ...
|
|
I couldn't understand the avalanche effect in DES. Could someone explain how avalanche effect happens in DES
|
|
Wikipedia has a nice section regarding the speedup of the RSA decryption using the Chinese Remainder Theorem here. I need to understand the implementation of a similar speedup for the encryption ...
|
|
I've always been interested in encryption but I have never found a good explanation (beginners explanation) of how encryption with public key and decryption with private key works.
How does it ...
|
|
When choosing the public exponent e, it is stressed that $e$ must be coprime to $\phi(n)$, i.e. $\gcd(\phi(n), e) = 1$.
I know that a common choice is to have $e = 3$ (which requires a good padding ...
|
Can you answer these questions?
|
|
Say that I have a signing/verification key pair $(sk,vk)$ and I generate a signature $\sigma$ over a message $m$. Then, I want to prove to someone else of this fact, which can be done in two different ...
|
|
I was looking through https://csrc.nist.gov/projects/post-quantum-cryptography/selected-algorithms-2022
How can one begin to mathematically verify if there are no backdoors to these selected post ...
|
|
I'm writing a higher-order function in Haskell for use in public-key algorithms; it works equally well for RSA or elliptic curves. I'd like to test it for susceptibility to side channel attacks. How ...
|
