Reputation
21,859
Next tag badge:
98/100 score
23/20 answers
Badges
4 29 79
Impact
~466k people reached

Feb
9
reviewed Satisfactory Does RSA-OEAP have integrity and authenticity properties?
Feb
9
reviewed Satisfactory A situation where security by obscurity might be the best solution - or am I wrong?
Feb
9
reviewed Satisfactory FIPS 140 compliance for encrypted files
Feb
9
reviewed Excellent On-the-fly computation of AES Round Keys for decryption?
Feb
9
reviewed Satisfactory Number of states in a LFSR
Feb
9
reviewed Excellent Blind quantum computing and fully homomorphic encryption
Feb
8
comment What are alternatives to the random oracle model for modelling hash functions?
Please don't post the same question at two StackExchange sites. (Cross-posting is discouraged on StackExchange.) Pick one to keep, and flag the other the moderators to ask them to close it: you can click the "flag" button beneath the question to do so.
Feb
6
comment Source for examples with broken cryptography
A5/3 is fine, for its intended purpose. The claims that it is broken are greatly exaggerated.
Feb
6
answered What are alternatives to the random oracle model for modelling hash functions?
Feb
2
answered Why would this method of discrete logarithm finding not work?
Feb
1
accepted Discrete log analog of ECM factoring algorithm?
Feb
1
comment Discrete log analog of ECM factoring algorithm?
@CrisStringfellow, I assure you, your method does not work. A full explanation of why it doesn't work is beyond the scope of this comment thread. But I'll give you a hint. Suppose we have $g=b^k \bmod p$, and we factor the integer $g$ into the factors $g=ef$. It is simply not true that the discrete log of $e$ will always be smaller than $k$. And that's all I'm going to say on this subject. If you want to understand this further, please ask a different question, rather than posting comments here. Further comments on this subject are likely off-topic.
Jan
31
comment Discrete log analog of ECM factoring algorithm?
@CrisStringfellow, thanks for the thought, but that is not correct: your method does not work. The error in your reasoning is in the part where you say "which is by definition smaller". To discover the error for yourself, try writing out the exact reduction: an algorithm which computes the discrete logarithm, given a magical black box that factors any integer of your choice. Then, try to analyze the running time of your scheme. I think you'll find your method doesn't work.
Jan
25
asked Discrete log analog of ECM factoring algorithm?
Jan
24
comment Are there hash algorithms with variable length output?
@BMiner, sometimes some crypto libraries will generate the IV for you and include the IV in the ciphertext. In other words, when you encrypt, you pass in a key and a message, and you get back a ciphertext, where the ciphertext includes the IV somewhere in it. If your library is like that, you need to remove the IV (and make sure that the IV always starts at 0). This gets easier if you implement AES-CTR yourself, so you can force it to start at IV 0 and make sure that the output only includes the generated pseudorandom stream (and not the IV).
Jan
23
revised Initialize a PRNG with a password
added 36 characters in body
Jan
23
comment Initialize a PRNG with a password
@Gilles, in principle, I agree, but passwords almost never have enough entropy (particularly if you need to ask).
Jan
23
revised Initialize a PRNG with a password
deleted 431 characters in body
Jan
23
comment Initialize a PRNG with a password
@Gilles, you are right. My mistake. Thank you.
Jan
23
answered Initialize a PRNG with a password