Top new questions this week:
|
|
I'm trying to understand the GF theory, but every time I come across information about AES it all makes no sense.
In my opinion $GF(2^8)$ defines any polynomial of the form:
$a_{7} x^7 + a_{6} x^6 + ...
|
|
I am wondering if there is any available threshold crypto library that is well-audited and ready to be used in production.
Any pointer is appreciated.
|
|
I know AES-GCM and AES-CCM but what is the difference between AES-CCM8 mode and AES-CCM mode ? Is it the length of the cipher?
|
|
I am trying to find a reduction for the following DLOG problem in generic groups. It is a simple generalization but I'm not finding any reference (the closest being the Chaum-Pedersen signature scheme ...
|
|
I'm a bit confused on how to validate the authentication tag between two different AES GCM implementations.
One implementation (on my part) is in Java. The other, I don't know.
In my implementation, ...
|
|
skinny cipher has been lately considered as ISO/IEC standard while is still competing as building block of Romulus AEAD in NIST LWC finalists.
what is the difference between the two ISO and NIST ...
|
|
I implemented carry-less multiplciation using the CLMUL instruction set. This is similarly fast to simple modulo multiplication. But computating the result mod some polynomial is still very slow. I do ...
|
Greatest hits from previous weeks:
|
|
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 ...
|
|
My question might appear the same as the question Taking advantage of one-time pad key reuse?, but actually I did read all the answers and none of them helped me with the details I need.
I am new to ...
|
|
I have a code for polynomial multiplication and it is written in C. I heard that whether a particular instruction is "constant time" can vary by architecture and by processor model and there ...
|
|
I'm using the SHA1/2 family of algorithms for a particular project. I was wondering if all the SHA algorithms return a fixed length hash regardless of the length of the data.
|
|
I am often told that any key can be broken and that it is only a matter of time and resources for any key to be broken. I know that this is technically true. However, I think that there is probably a ...
|
|
I am working on a web application enabling users to communicate over private messages which is just one part of the whole system. The main focus during my development process is to protect the privacy ...
|
|
Given $n=pq$ for $p,q$ known, I can calculate $\phi(n)$.
$e$ is selected such that $\gcd (e,\phi(n)) = 1$.
Using this, how do I calculate the RSA private key?
Example:
I have $n = 35$, with $(p,...
|
Can you answer these questions?
|
|
Any body can explain, what are the key difference between Shannon entropy and Guessing Entropy? In some research I got entropy uses binary search or balanced huffman tree. Guesswork uses linier and ...
|
|
Basic question: ENT seems to trip up generators that pass NIST 800-22 and maybe even dieharder. How do the latter two test suites miss such an obvious failure?
There are two things I want to mention ...
|
|
Consider for example this set of encrypted values under the Elgamal keys $y_0$,$y_1$,$y_2$: $$
Enc_{y0}(g^0),Enc_{y1}(g^{-20}),Enc_{y2}(g^{-10})
$$
Can I prove that one value is $g^0$ and the others ...
|
