Top new questions this week:
|
|
Here is Ariel Gabizon’s Blog for the process of converting Arithmetic Circuits into R1CS – electriccoin.co/blog/snark-explain5/ Here, he writes We assume multiplication gates have exactly two …
|
|
That is, in the case where the iterations value is a large number, since iterations are costly is there a difference in security of doing something like this, where two separate derivations are …
|
|
Section 5.1 of FIPS 186-4 states that An RSA key pair used for digital signatures shall only be used for one digital signature scheme (e.g., ANS X9.31, RSASSA-PKCS1 v1.5 or RSASSA-PSS) and RSA …
|
|
Suppose that I’ve solved the Discrete Logarithm problem. Can someone explain to me in terms of the example below how to arrange values of Elliptic Curve secp256k1 in a reverse form so that I can …
|
|
I was reading “TFHE Deep Dive” from Ilaria Chillotti, and I am a bit confused over the sample given in 31:08 In the above toy sample, isn’t it possible to directly eliminate noise by …
|
|
NIST SP 800-57 Part 1 rev 5 section 5.6.1.1 gives following comparison between different encryption types. For example, it shows that 3TDEA, RSA-2048, ECC224 provides security strength of 112 bits. …
|
|
This is from Vitalik Buterin’s post. Here he says Note that modulo (%) and comparison operators (<, >, ≤, ≥) are NOT supported, as there is no efficient way to do modulo or comparison directly …
|
Greatest hits from previous weeks:
|
|
If part of the password is a whole regular English word, does the entropy of that part depend on the number of English words in existence, the number of English words known by the choosing algorithm, …
|
|
Is there any reference to check the list of encryption & signing algorithms which are compliant to FIPS 140-2. After an exhaustive search I could find only “AES”. Any suggestions would be much …
|
|
Have there been any publicly known exploits of a cryptographic break in a widely used cryptographic system to actually read encrypted information (or falsely authenticate) since the Ultra program in …
|
|
I am looking into using AES256-GCM for encrypting some database fields. I know that for AES256-CBC, I need to generate a new IV for each encrypt, but I can use the same key. The IV can be openly …
|
|
Suppose Alice wants to send encryptions (under a one-time pad) of $m_1$ and $m_2$ to Bob over a public channel. Alice and Bob have a shared key $k$; however, both messages are the same length as the …
|
|
Symmetric key cryptography is an encryption system in which the sender and receiver of a message share a single, common key that is used to encrypt and decrypt the message. Is the key public or it is …
|
|
I’m getting this strange result that SHA-512 is around 50% faster than SHA-256. I’m using .net’s SHA512Managed and SHA256Managed …
|
Can you answer these questions?
|
|
In a system that relies on decentralized identity, is it possible to prevent duplicate uses of the same real-life identity, i.e. same real-life person creates more than one user entity (each is …
|
|
For example zcash uses such approach with Pederesen hash which is collision-resistant, but not preimage-resistant. I assume that it’s used to ensure that we can’t reuse hash from one level which …
|
|
p = 115792089237316195423570985008687907853269984665640564039457584007908834671663 How to map points from curve …
|
