Reputation
4,107
Next tag badge:
98/100 score
16/20 answers
Badges
1 9 30
Newest
 Pundit
Impact
~88k people reached

Feb
5
comment How to check the strength of an encryption algorithm?
If you have to ask, it's not secure at all.
Feb
4
comment Entropy in natural language texts
How is collecting a huge library of texts, and generating something that sort-of kind-of looks random from it, simpler and less awkward than generating 128-256 pseudorandom bits from a well-vetted and easily accessible source of entropy? Your scheme doesn't even let you measure the amount of entropy you're collecting to any degree of accuracy ("entropy" is a lot more than just "english text has 0.6 to 1.3 bits of entropy per character").
Feb
4
comment Entropy in natural language texts
Which is exactly what I said. What advantage does your scheme have over, say, using AES? And what advantages does AES have over yours? In your application, that is.
Feb
4
comment Entropy in natural language texts
But since you - obviously - no longer have unconditional security, what advantages does this awkward and complicated scheme have over just using generic cryptographic primitives?
Feb
2
awarded  Custodian
Feb
2
reviewed Needs Improvement Two step encryption
Feb
2
reviewed Satisfactory Future-Proof Versioning and Validation
Feb
2
reviewed Satisfactory FIPS 140 compliance for encrypted files
Feb
2
reviewed Satisfactory Blind quantum computing and fully homomorphic encryption
Feb
2
reviewed Excellent What exactly is a negligible (and non-negligible) function?
Feb
2
reviewed Satisfactory Does RSA-OEAP have integrity and authenticity properties?
Feb
2
reviewed Excellent Deriving Keys for Symmetric Encryption and Authentication
Feb
2
reviewed Satisfactory A situation where security by obscurity might be the best solution - or am I wrong?
Feb
2
reviewed Satisfactory Number of states in a LFSR
Feb
2
comment ECDH VS. DH benchmarking in JAVA
@CodesInChaos Thanks for the correction, not very literate in ECC. Still, I think the question should be rewritten to ask for theoretical differences in performance (based on the algorithms themselves and not a black-box implementation) to be on topic.
Feb
2
comment ECDH VS. DH benchmarking in JAVA
Sorry but none of us know how to program, at least that is the assumption you should be going with when posting on Crypto SE. It is likely questions with large amounts of code are better suited on StackOverflow or Security SE, and it is the case here. That said, I suppose the time difference is due to the fact that generating an ECDH key isn't as easy as selecting a random prime, you need to perform some setup operations, likely more than in DH (or maybe your KeyPairGenerator is slow, but that's out of our control).
Feb
2
comment Why would this method of discrete logarithm finding not work?
Python would probably be simpler than GP/Pari for prototyping, at least in my opinion, and when applied to most input sizes, algorithmic performance will dominate anyway.
Jan
31
comment Is (2^333)-1 a prime number?
Ask Wolfram|Alpha!
Jan
31
comment How to best obtain bit sequences from throwing normal dice?
@owlstead Feel free to edit my answer to insert your results in, they would be a useful and welcome addition :)
Jan
31
revised How to best obtain bit sequences from throwing normal dice?
grammer!!