Reputation
4,283
Next tag badge:
101/100 score
17/20 answers
Badges
1 10 32
Newest
 Enlightened
Impact
~100k people reached

Feb
8
comment Is $f(x)\oplus x$ a one-way function?
@PaŭloEbermann If one-way functions don't exist then the question is vacuous since it is predicated on $f$ being a one-way function :)
Feb
6
comment Why is knowing M not enough to break Blum Blum Shub?
What makes you think $x_n$ is available to you? :)
Jan
27
revised blake2 wiki excerpt
added 138 characters in body
Jan
26
comment How does BLAKE2 ensure that hash(A) != hash(B) when B = A||0 and both A & B have the same number of blocks?
[created the tag for you]
Jan
26
wiki created blake2 excerpt
Jan
26
suggested approved edit on blake2 tag wiki excerpt
Jan
26
revised How does BLAKE2 ensure that hash(A) != hash(B) when B = A||0 and both A & B have the same number of blocks?
edited tags
Jan
26
answered Decrypt files with original file CTB-Locker
Jan
26
awarded  Yearling
Jan
6
comment Are there cryptographic hash functions which do not have any collisions?
@fgrieu Indeed, but that can be considered practically infinite for most intents and purposes - perfect hash functions on the other hand usually have such a small domain that they can hardly be called cryptographic. most of them, anyway. (in my experience)
Jan
5
comment Is there a hash function which has no collisions?
Perfect hash functions are not cryptographic hash functions as their domain is finite.
Jan
5
comment Are there cryptographic hash functions which do not have any collisions?
Perfect hash functions are not cryptographic hash functions as their domain is finite.
Dec
26
awarded  Enlightened
Dec
26
awarded  Nice Answer
Dec
24
answered Significance of 3mod4 in squares and square roots mod n?
Dec
23
awarded  Cleanup
Dec
15
comment How to customize a standard encryption algorithm?
What do you mean by "customize"? Do you really want to modify the entrails of the algorithm, or do you just need a parameterized block cipher built on top of AES (with provably equal strength) to differentiate it from other uses of AES, akin to Skein's personalization string?
Dec
12
comment Crack RSA with imaginary algorithm
@AndrewPoelstra Finding multiplicative inverses is always easy, Euclid came up with a working algorithm over two millenia ago. What is hard without the factorization is finding multiplicative orders.
Dec
11
comment 2048-bit RSA Decryption
@fgrieu "problem solved" doesn't sound like breaking an honor code to me. Anyway, the question has been rolled back (thanks CodesInChaos).
Dec
11
comment 2048-bit RSA Decryption
What is the point of deleting questions? If you do that, nobody else can benefit from it later on. Please consider posting your solution as an answer for future visitors.