User alpominth

3 votes

1 answer

241 views

What is the post-quantum security of encryptions schemes based on transpositions?

asked Apr 19 at 5:19

2 votes

1 answer

444 views

Is there a simple formula to calculate how many inputs generate same outputs in cryptographic hash functions, being the input larger than the input?

asked Apr 3 at 6:39

2 votes

1 answer

66 views

When the input size in a PRF is larger than the output and many inputs will generate the same output, but why AES-256 in CTR mode is considered safe?

asked Mar 3 at 3:25

1 vote

0 answers

87 views

Why do the hash functions tested by SMhasher appear to be exceptionally fast?

asked Mar 10 at 20:34

1 vote

0 answers

41 views

How to estimate the collision resistance of a hash function if a secondary key is used (keyed hash function)?

asked Mar 17 at 23:15

1 vote

1 answer

143 views

Does an increase of message size increase the number of guesses to find a collision?

asked Mar 17 at 23:57

1 vote

1 answer

42 views

Is it safe or reasonable to use the key parameter in a cryptographic hash function as a counter?

asked Mar 18 at 2:21

1 vote

1 answer

59 views

In CTR block cipher mode of operation, can I reuse the nonce with another key for encrypting another plaintext if using different counters?

asked Mar 20 at 5:30

1 vote

2 answers

277 views

How changing a single byte/word in a substitution box affects the inverse result?

asked Apr 12 at 6:34

1 vote

1 answer

69 views

Why hashing a seed to generate a key and using chaining to get the rest of key matterial is not secure?

asked Mar 2 at 19:37

0 votes

0 answers

44 views

Hashing a seed full of entropy with a cryptographic hash function and emiting a key with the same size as input: can a collision attack occurs?

asked Mar 22 at 8:30

0 votes

1 answer

110 views

If I encrypt two plaintexts with different keys, XOR the ciphertexts and send to an adversary, what can he/she do with what I sent?

asked Mar 26 at 4:13

0 votes

0 answers

21 views

Once a secure hash function built up a (fast) internal hash table, can data to be hashed be different from the data inserted when doing the lookups?

asked Mar 12 at 21:51

0 votes

1 answer

54 views

Is there a way to make a pseudorandom function to generate decimal numbers in a specified range and not only producing big ones?

asked Mar 12 at 23:49

Stack Exchange Network

14 Questions

What is the post-quantum security of encryptions schemes based on transpositions?

Is there a simple formula to calculate how many inputs generate same outputs in cryptographic hash functions, being the input larger than the input?

When the input size in a PRF is larger than the output and many inputs will generate the same output, but why AES-256 in CTR mode is considered safe?

Why do the hash functions tested by SMhasher appear to be exceptionally fast?

How to estimate the collision resistance of a hash function if a secondary key is used (keyed hash function)?

Does an increase of message size increase the number of guesses to find a collision?

Is it safe or reasonable to use the key parameter in a cryptographic hash function as a counter?

In CTR block cipher mode of operation, can I reuse the nonce with another key for encrypting another plaintext if using different counters?

How changing a single byte/word in a substitution box affects the inverse result?

Why hashing a seed to generate a key and using chaining to get the rest of key matterial is not secure?

Hashing a seed full of entropy with a cryptographic hash function and emiting a key with the same size as input: can a collision attack occurs?

If I encrypt two plaintexts with different keys, XOR the ciphertexts and send to an adversary, what can he/she do with what I sent?

Once a secure hash function built up a (fast) internal hash table, can data to be hashed be different from the data inserted when doing the lookups?

Is there a way to make a pseudorandom function to generate decimal numbers in a specified range and not only producing big ones?