Top new questions this week:
|
|
Let’s suppose I want to encrypt a 10GiB file but I don’t want to use a One Time Pad, just a 1MiB key taken from /dev/random (in Linux). I know that the key should not be repeated, but is it possible …
|
|
I was reading the Wikipedia page for SHA-256 (SHA-2) and came across the following statement: For a hash function for which $L$ is the number of bits in the message digest, finding a message that …
|
|
I have been reading about Zero Knowledge Proof (ZKP) protocols for a while now. Among the applications I have seen the most is authentication (ethereum.org/en/zero-knowledge-proofs/#…
|
|
We know that SHA-1 is susceptible to collision attacks, but what about pre-image attacks such as poisoning torrents?
|
|
If an attacker has a database of 1,000 users’ hashed passwords which are hashed with SHA-256 with a 128-bit salt and all of these users used 10,000 common passwords. How many hashes will the hacker …
|
|
I have some doubts regarding AES weakness and AES cryptanalysis. While it is relatively simple to find Cryptanalysis info on previous ciphers, I get confused about understanding various types of …
|
|
I was looking at the archives for the British national cipher challenge, and a modified version of an ADFGVX cipher came up twice (2003 2011), with block transposition instead of columnar …
|
Greatest hits from previous weeks:
|
|
From Wikipedia: Second pre-image resistance Given an input $m_1$ it should be difficult to find another input $m_2$ such that $m_1$ ≠ $m_2$ and $\operatorname{hash}(m_1) = \operatorname{hash}…
|
|
HMAC-based One Time Password (HOTP) was published as an informational IETF RFC 4226 in December 2005. In May, 2011, Time-based One-time Password Algorithm (TOTP) officially became RFC 6238. What …
|
|
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 …
|
|
Out of curiosity why we can’t implement AES 512 key size? Please explain somehow i can understand! I’m not an expert.
|
|
Frequently, we want to send messages that are (a) encrypted, so passive attackers can’t discover the plaintext of the message, and (b) signed with a private-key digital signature, so active attackers …
|
|
One runtime platform provides an API that supplies PKCS#5 padding for block cipher modes such as ECB and CBC. These modes have been defined for the triple DES, AES and Blowfish block ciphers. The …
|
|
Say I want to write an encryption algorithm to communicate between me and my friend for this private use. How is that bad? E.g. I can take the word Hello and …
|
Can you answer these questions?
|
|
I want to prove that for every pseudorandom function $F: \{0, 1\}^n \times \{0, 1\}^n \rightarrow \{0, 1\}^n$ and for every polynomial $p$ such that $p(n) > 1$ for every $n$ it is possible to …
|
|
In this journal paper related to physically unclonable function (PUF) [1], the authors used NIST 800-22 test to check if the bitstreams generated by their PUFs are random, which is described as …
|
|
I am working on a project that uses PAKE (SRP) for authentication. When we send the M1 to the server we are encrypting the payload using AES-GCM. I mention SRP only to set the context: A message is …
|
