SHA-3 vs the world @ OWASP London posted November 2017
I just gave a talk at OWASP London on SHA-3 and derived functions + derived protocols.
It was apparently the first crypto talk in 5 years so I'm glad I revived this part of OWASP =)
Well done! You've reached the end of my post. Now you can leave a comment or read something else.
Here are some random popular articles:
- - Developers Are Not Idiots
- - A New Public-Key Cryptosystem via Mersenne Numbers
- - Hash-Based Signatures Part I: One-Time Signatures (OTS)
- - BEAST: An Explanation of the CBC Attack on TLS
- - The 9 Lives of Bleichenbacher's CAT: New Cache ATtacks on TLS Implementations
- - QUIC Crypto and simple state machines
- - Zero'ing memory, compiler optimizations and memset_s
Here are some random recent articles:
- - Two And A Half Coins #7 - It's time to talk about Ethereum
- - Plonk's permutation, the definitive explanation
- - Zero-knowledge proofs in stateful applications
- - Verifying zero-knowledge proofs on Bitcoin?
- - An introduction to multi-party computation (videos)
- - Mum, I was on the zkpodcast!
- - zksecurity.xyz
Comments
fdsafd
ffffffffffffffffffffffff yes
dafdfdsfds
Sc00bz
Three minor things:
33:10: Parallel vs sequential for passwords. Parallel is better because it is faster. Note more work in less time is better.
44:27: Stream cipher, not one time pad.
50:31: Skylake doesn't have SHA instructions. So those are max speeds (Assumes code is optimized). Note ARM has SHA1 and SHA256 since forever (Now even Raspberry Pi has it: 2 v1.2, 3, 3+). If you ran SHA256 like K12, "Kangaroo-SHA256 " would be faster.
leave a comment...