Top new questions this week:
|
|
Say a server wants to hash a password $p$. It would use a secure hash function $H$ and a unique salt $s$ to hash the password as $H(p,s)$. If one has access to the salt, each password candidate …
|
|
The past few weeks I have been trying to solve a difficult problem. I have asked some cryptography experts but unfortunately they had no clue on how to solve the problem. The situation is as follows, …
|
|
What is a good method to generate random numbers between 0 and n from random bits? For example, i have a one million random bits generated according to NIST SP 800 90 publications. Now i need to …
|
|
Intuitively I think not because assuming the bit string $x_1,x_2 \sim \{0,1\}^{n/2}$, $x_1 \wedge x_2$ is not uniformly random so if $g$ were still a one-way function then the fact that the definition …
|
|
Assume a 256-bit ECDSA private key used with Secp256k1 and SHA-256. This key signs multiple different messages in a fully deterministic manner as described in RFC-6979, so signing the same message …
|
|
I am new to lattice theory. I hope(will be grateful) that one could explain to me this claim 7 in REGEV course(this claim appears in this file page 6 : cims.nyu.edu/~regev/teaching/…
|
|
I’m trying to figure out how to convert a circuit into a Square Arithmetic Program (SAP). This is to eventually use it for zk-SNARKs such as Groth16. I do however understand how to convert arithmetic …
|
Greatest hits from previous weeks:
|
|
What are the benefits and disadvantages of CBC vs. CTR mode? Which one is more secure?
|
|
I’m getting this strange result that SHA-512 is around 50% faster than SHA-256. I’m using .net’s SHA512Managed and SHA256Managed …
|
|
What is the currently industry-standard algorithm used to generate large prime numbers to be used in RSA encryption? I’m aware that I can find any number of articles on the Internet that explain how …
|
|
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 …
|
|
When given $p = 5, q = 11, N = 55$ and $e = 17$, I’m trying to compute the RSA private key $d$. I can calculate $\varphi(N) = 40$, but my lecturer then says to use the extended Euclidean algorithm to …
|
|
On a recent question it became apparent that there’s a significant difference between an HMAC of input data and a hash of input data. What exactly is the difference between an HMAC and a hash of a …
|
|
Like in title: which one of these encryption methods (ZipCrypto, AES-256) is more secure and why? I am asking about it because I’d like to know which should be preferred when compressing files with …
|
Can you answer these questions?
|
|
I am trying to find discrete log over $GF(P)$ using Cado-NFS (gitlab.inria.fr/cado-nfs/cado-nfs/-/blob/master/README.dlp). It works well for random primes. But if I take primes that are …
|
|
Recently, I’ve been working on disk encryption. I started with the AES-XTS mode which is the standard for this purpose and tried to understand the concept of disk encryption in general. I know that …
|
|
I’m following ZK MOOC: zk-learning.org/ After some previous readings about these topics, I was believing to have understood that, stated that non-interactivity isn’t attainable in standard/…
|
