20,530 reputation
32573
bio website
location
age
visits member for 3 years, 2 months
seen 5 hours ago

Oct
20
revised Does encrypting a hash of the message yield a secure MAC?
Clean up the title. It's not whether we "consider" it secure, the question is whether it *is* secure.
Oct
20
revised Proof that MACing a hash of the message is also a secure MAC
Fix title. Clean up wording. Improve tags.
Oct
20
comment Encoding information in packet lengths to actively sidestep encryption
The relevant concepts are: "side channels", "covert channels", and "steganography". As K.G. said, covert channels or stego are probably the ones most relevant to you.
Oct
14
answered Why to try get key out of white box crypto? How can one protect WBC itself?
Oct
11
reviewed Reject suggested edit on literature tag wiki excerpt
Oct
11
reviewed Reject suggested edit on literature tag wiki
Oct
10
revised NP complete problems related to permutations of binary vectors or block ciphers
added 242 characters in body
Oct
10
answered NP complete problems related to permutations of binary vectors or block ciphers
Oct
10
comment The Goldreich-Goldwasser-Micali Construction with bad PRGS
I very much doubt that GGM will offer useful security if the underlying PRG has a significant bias. I think your argument is unconvincing and your hypothesis is unlikely to hold.
Oct
8
reviewed Reject suggested edit on timestamping tag wiki excerpt
Oct
8
reviewed Reject suggested edit on timestamping tag wiki
Oct
8
comment Predicting values from a Linear Congruential Generator
See also security.stackexchange.com/q/4268/971 for more on cracking LCGs (though with a different set of assumptions).
Oct
8
answered WIN LM Password Hashes (using John the ripper)
Oct
7
comment Openssl & RSA : how many public exponents are possible?
There are no security benefits to large exponents (assuming you use RSA properly, including proper padding and so forth; and if you don't use RSA properly, then you've got bigger problems and might be in trouble no matter what exponent you use).
Oct
7
answered Self authenticating tamper resistant first meetings
Oct
7
revised Relationship between Elliptic Curve Discrete Log, Integer Discrete Log, and Integer Factorization
Fix formatting. Make the question much more concise.
Oct
7
awarded  Revival
Oct
7
awarded  Nice Question
Oct
4
answered Elliptic curve cryptography attack vector
Oct
3
comment Calculating ciphersize of Paillier, SSE and OPE
Similar comments apply to SSE and OPE. It is extremely unlikely that 64 bits will be sufficient for the ciphertexts of SSE and OPE. And, as explained in my answer, the length of the ciphertexts for OPE and SSE depends upon which scheme you use, so there is not one answer to the question (your answer seems to be based upon the erroneous premise that there is only a single algorithm for SSE/OPE).