Reputation
14,465
Next tag badge:
102/100 score
17/20 answers
Badges
1 36 76
Newest
 Nice Answer
Impact
~288k people reached

Oct
12
comment Why many passes at file removal?
I'm closing question as off-topic because it is a question about physical security, not about cryptography.
Oct
12
comment Encoding scalar values to points on Ed25519
@zmanian Not sure what you mean by converting, but the closest analogy to such a conversion is scalar multiplication with the base point.
Oct
11
comment Encoding scalar values to points on Ed25519
Then please clarify your question and include what you're doing and what the expected result is.
Oct
11
comment Encoding scalar values to points on Ed25519
The scalar multiplication routines in Ref10 set the most significant bit of the scalar to 1, which interacts badly with computed scalars. You need to remove those masking code lines.
Oct
11
revised Effect of message length on collision attacks
added 3 characters in body
Oct
11
reviewed No Action Needed Improve security of transposition ciphers
Oct
10
reviewed Reject Which is more secure, using just bcrypt or SRP?
Oct
9
comment How to protect key in software
What is your threat model? Do you write DRM which acts against the user's desires? Or do you write software that's a faithful agent of the user?
Oct
9
comment Is there a cryptographic protocol that let's me prove someone has a large binary?
Related question: Proof of storage scheme
Oct
9
comment The example of Wikipedia on steganography doesn't work
I'd multiply with 85, so maximal value of 3 turns into 255
Oct
9
comment Powerline password conversion
I'm voting to close this question as off-topic because because it's more about reverse engineering than about cryptography. I'm not migrating it to reverse engineering because it's a "How do I get started reversing this firmware?" question and thus rather broad.
Oct
8
reviewed Approve Creating own ciphertext after a padding oracle attack?
Oct
7
comment Are there MD5 collisions for inputs of different length?
Those collisions exist, but I'm not sure if we know how to find them. Merkle-damgaard includes the message length in the last block, which prevents us from turning a simple chosen-prefix collision into a collision of different length messages.
Oct
6
comment RSA 1024 bit forge a new matching signature from a chosen message
Check out '4.1 Coppersmith's theorem' in Boneh's Twenty Years of Attacks on the RSA Cryptosystem
Oct
6
awarded  Nice Answer
Oct
5
comment Bcrypt input length vs collisions
I'd use a simple unsalted hash.
Oct
5
reviewed No Action Needed Is it safe to use MD5 in a proof of work system?
Oct
5
reviewed No Action Needed Does the length of the keyword used for keytable for Playfair matter?
Oct
4
comment Bcrypt input length vs collisions
Bcrypt is good for hashing passwords. For hashing high entropy tokens I'd use SHA-2.
Oct
4
revised Why do we require a CSPRNG's output to be indistinguishable from true random?
deleted 1 character in body