Reputation
14,560
Next tag badge:
102/100 score
17/20 answers
Badges
1 36 76
Newest
 Nice Answer
Impact
~289k people reached

Sep
26
comment Shared modulus attack on RSA
Why are you using several exponents? What advantage over a single $e$ do you expect from that?
Sep
26
comment Shared modulus attack on RSA
Are those people using the same $e$? If no, why?
Sep
26
revised If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
added 3 characters in body; edited title
Sep
26
reviewed Leave Closed research on Encryption for master
Sep
26
reviewed Reviewed converting finite field elements to octet strings
Sep
26
revised converting finite field elements to octet strings
added 18 characters in body
Sep
26
comment If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
I've edited the duplicate question so it's applicable to more hashes.
Sep
26
revised Are common cryptographic hashes bijective when hashing a single block of the same size as the output?
added 56 characters in body; edited tags; edited title
Sep
26
reviewed Close If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
Sep
25
reviewed Close What is the significance of the Period of a Steam Cipher
Sep
24
comment Bobcat hash, trying to find a 48-bit hash collision for x
For a 48 bit hash you could simply use a hashtable with around $2^{24}$ entries, no need for fancy algorithms like cycle finding.
Sep
20
comment Is ChaCha20 alone sufficient for securing data-at-rest?
@Kar Because those only protect against accidental corruption (e.g. a cosmic ray flipping a bit) and not against deliberate manipulation.
Sep
20
comment Is ChaCha20 alone sufficient for securing data-at-rest?
@Kar MACs are the cryptographic equivalent of checksums.
Sep
20
comment Is ChaCha20 alone sufficient for securing data-at-rest?
@Kar For local files active attacks (AKA Chosen-Ciphertext-attacks) don't matter much, but when you store it in the cloud, the server could return a manipulated file.
Sep
20
comment Is ChaCha20 alone sufficient for securing data-at-rest?
In the age of cloud backup I'd prefer including a MAC.
Sep
19
comment Maximum steganographic embedding rate not detectable by steganalysis?
I'm not an expert on steganography, but I don't consider the claim "obvious". For example when I consider raw images, they'll contain noise in the least significant bits. When done carefully, with knowledge of the camera's noise properties, replacing these with steganografic data that looks like noise should be possible.
Sep
19
reviewed Close If you were to design a PKI from scratch, what would you do?
Sep
19
comment Does RSA operate over a Finite Field (Galois Field)?
The RSA modulus is not prime, so arithmetic modulo n is no finite field. So that statement is either wrong, or at least very misleading. (Using a sufficiently loose interpretation of "based on" you could say that private key arithmetic using the Chinese-Remainder-Theorem works in several finite fields, one per factor of the modulus, but I don't think that's a useful interpretation)
Sep
18
comment Why can't we use a hash with no collision to compress data reliably?
While a perfect hash has no collisions, it as a fixed set of inputs. Essentially you're creating a lookup table in algorithm form.
Sep
18
reviewed Reviewed Switching between AES and a highly performant algorithm