Reputation
14,520
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
3 16 60
Newest
 Nice Answer
Impact
~233k people reached

5h
comment HW acceleration for Camellia cipher (x86_64/AES-NI/AVX2)
@otus That link just displays a login page unfortunately (without explaining what login is required). Interesting information though. It could still require some configuration - kinda hard to establish without more info.
6h
comment HW acceleration for Camellia cipher (x86_64/AES-NI/AVX2)
After looking at the Japanese information on it I tend to agree with this opinion.
6h
answered HW acceleration for Camellia cipher (x86_64/AES-NI/AVX2)
6h
comment HW acceleration for Camellia cipher (x86_64/AES-NI/AVX2)
@Raoul722 That C code mostly looks like a stub. However, up till now I didn't find any OpenSSL implementations that use AES-NI, so it is probably not supported out of the box.
1d
accepted Side channel security of HMAC in software
1d
comment Security of RSA for paranoids with padding?
Still an interesting question, have you made any progress on this? Note that PACE-CAM could also be considered for dual authentication (SPAKE seems to only provide chip authentication ).
1d
comment What is the difference between SHA-3(Keccak) and previous generation SHA algorithms?
This is indeed the reason why the SHA-3 competition was started. I'm not sure that this is the main reason why Keccak was chosen though, and I did at least follow the mailinglist.
1d
comment Why is AES-SIV not used, but AESKW, AKW1?
AES-SIV is 6 years newer and the other wrapping mechanism isn't exactly broken. Personally I don't like the fact that AES-SIV places the IV at the start. This means you cannot encrypt the key value in place. That's not a huge issue when used as a cipher, but it unnecessarily complicates memory handling when used for key wrapping.
1d
comment Can OTP be made practical by using stretched hash algorithms?
@RickyDemer True, not with regards to secrecy though :)
1d
comment Can OTP be made practical by using stretched hash algorithms?
@JamesCameron You should be able to just paste the link in the top text field (or maybe that only comes with more rep, I'm not 100% sure). A somewhat belated welcome to crypto, by the way :)
1d
comment Can OTP be made practical by using stretched hash algorithms?
Although I've answered, mainly to directly answer some parts of the question of James, I don't mind if this gets closed or not. I do think there will be many dupes in the end.
1d
comment Can OTP be made practical by using stretched hash algorithms?
With an OTP an "added layer of security" doesn't make any sense. Either it is perfectly secure, or it is not.
1d
revised Can OTP be made practical by using stretched hash algorithms?
added 10 characters in body
1d
revised Can OTP be made practical by using stretched hash algorithms?
added 10 characters in body
1d
answered Can OTP be made practical by using stretched hash algorithms?
1d
comment What are the practical implications of ciphertext distinguishability?
I don't see how e.g. leaking the parity of messages would allow you direct access to the plaintext. Maybe an attack would be possible but that would require more messages. This seems contrary to your answer; you'd have at least substantially add to your answer to make this believable. Just pointing to a paper for this is not enough. Please prove my initial assumption wrong!
1d
comment “Royal Flags Wave Kings Above”
We're fortunate that the people at Bletchley were better at correctly guessing hidden messages, eh?
1d
answered “Royal Flags Wave Kings Above”
1d
reviewed Approve Merkle tree (dm-verity) with SHA-256 vs. SHA-1
1d
comment What is the difference between SHA-3(Keccak) and previous generation SHA algorithms?
That's a bit strange. Skein seems to have this kind of flexibility as well, and that's certainly Merkle–Damgård. Furthermore, as it contains a 256 bit tweakable block cipher, it would be very useful to create a complete symmetric cryptosystem. That's why I supported it anyway. There are of course other considerations such as speed as well though.