Reputation
1,052
Top tag
Next privilege 1,250 Rep.
Create tag synonyms
Badges
4 27
Impact
~29k people reached

2d
comment POODLE attack on TLS 1.2
@dave_thompson_085 This was mentioned in the answer: "The normal recommendation for POODLE where SSLv3.0 cannot be disabled entirely is to implement TLS_FALLBACK_SCSV support"
Sep
1
comment POODLE attack on TLS 1.2
@HenrickHellström True. I can't remember specifically, but I believe that most practical SSLv3.0 implementations use a single padding length byte at the end, fill the rest with zeros or random data, and don't validate the padding data on receipt. But that's not to say that an implementation couldn't validate padding - it just wouldn't work with most implementations.
Sep
1
answered POODLE attack on TLS 1.2
Sep
1
asked What is the impact of a server not fully verifying the data in the Client Finished packet of a TLS connection?
Aug
13
awarded  Popular Question
Jul
6
comment What is the complexity for attacking 3DES in linear or differential cryptanalysis?
@dave_thompson_085 Fixed the 2^64 error - thanks for spotting that. I left the peta/pebi change out because personally I think it's a bit of a silly distinction, fueled by manufacturers who want to get away with selling smaller drives than what the customer expected from the advertising. But that's a discussion for a different venue ;)
Jul
6
revised What is the complexity for attacking 3DES in linear or differential cryptanalysis?
Fixed 2^64 mistake.
Jul
3
answered What is the complexity for attacking 3DES in linear or differential cryptanalysis?
Jul
3
comment Reasons for components of AES
I quite like the terms "confusion and diffusion". Confusion describes taking some quantum of information (e.g. a byte) and turning it into something else, and diffusion describes taking some information and rearranging it so that the information is randomly spread about.
Jun
5
comment Why does anyone use elliptic curves for a CSPRNG?
@SOJPM AES-CTR was just an example - the point I was trying to make is that there other CSPRNG designs out there that don't have the "magic number" problem. That being said, your "provably secure" comment intrigues me - do you have a reference for a proof? I guess the proof relies upon the discrete log problem being known hard?
Jun
5
asked Why does anyone use elliptic curves for a CSPRNG?
May
8
comment At what point can you you implement crypto algorithms?
@NeilSmithline Also power analysis.
Apr
6
comment What makes this mixer function resistant to differential cryptanalysis?
Makes sense! Do you have a reference that explains the part about invertible vs. non-invertible s-boxes for SPNs? It sounds like an interesting topic.
Apr
6
accepted What makes this mixer function resistant to differential cryptanalysis?
Apr
6
comment What makes this mixer function resistant to differential cryptanalysis?
@MaartenBodewes As I said in the post, I was "testing some other randomly conjured up designs" - this construction was just invented by me trying random things.
Apr
3
answered Is the keystream transmitted with the ciphertext when a stream cipher is used?
Apr
2
answered Are there any valid, and person readable, checksums possible?
Apr
2
comment Are there any valid, and person readable, checksums possible?
I think OP is looking for something similar to the PGP word list.
Apr
2
comment What makes this mixer function resistant to differential cryptanalysis?
@Aleph Sorry, I'm not familiar with the term DDT. The s-box is just a randomly generated preset created by shuffling the numbers 0 to 255 - is it likely that this produced a good S-box in terms of differential properties?
Apr
2
comment What makes this mixer function resistant to differential cryptanalysis?
@kodlu 2, on an 8-bit input. Sorry, should've said.