192 reputation
6
bio website
location
age
visits member for 2 years
seen 2 days ago

Nov
20
comment BruteForcer XOR (bfxor.exe) to attack 64-bit keys and longer
That KGB agents found themselves in this scenario once doesn't imply that it is a "common mistake", especially in the digital age. In addition, there is no reason to believe that the reused pad would be just a handful of bytes reused as many times as is necessary to encrypt an entire file. It's an interesting problem and I'm certainly not telling you to stop your pursuit, but I am absolutely not convinced that it is of any practical value.
Nov
18
comment BruteForcer XOR (bfxor.exe) to attack 64-bit keys and longer
"Now this may all be laughable in 2014 though where most cryptographers and even I use 2048 to 8192-bit (256 to 1024 Bytes) Keys for XOR encryption" - No cryptographer in 2014 is using anything like a vigenere cipher.
Nov
14
comment Random Permutation polynomial
I'm not convinced that limiting the degree of the polynomial serves a purpose, and you have the problem that low-order permutation polynomials aren't going to be very random. $x + a$ defines a permutation for every $a$, but it's just a set of permutations of size $p$.
Nov
11
comment Random Permutation polynomial
1) That's different enough that you should probably ask separately 2) I don't know 3) it doesn't really sound like a crypto question anymore, mathoverflow.net might get you better answers.
Nov
7
comment Random Permutation polynomial
Right, the $q!$ part is just counting the permutations. Proving it fully does require the fact that all functions are expressible as polynomials. This follows from the construction I gave, though there are better proofs (that escape me right now). Note that the limit on the order of the polynomial comes from $x^q = x$.
Nov
7
revised Random Permutation polynomial
added answer to question 1
Nov
7
answered Random Permutation polynomial
Oct
16
comment Are LFSRs enough for this?
hmm, I just realized b and t are not the same... I'll have to think about t < b.
Oct
16
comment Are LFSRs enough for this?
An edit is fine with me, though I don't think you should make any more. Too many edits and it's a conversation, which the platform doesn't do well.
Oct
16
revised Are LFSRs enough for this?
considered new premise
Oct
15
revised Are LFSRs enough for this?
added 153 characters in body
Oct
15
answered Are LFSRs enough for this?
Oct
15
comment Are LFSRs enough for this?
If I know the initial state, can't I just step my copy of the LFSR until its state matches one of the tickets? If the time makes sense, assume it was the first player's otherwise keep stepping. Or are we assuming that there are too many steps to make this feasible?
Oct
13
answered Is it possible to 'fake' time for TOTP? (Time-based One-time Password)
Oct
8
comment Are hash functions chaotic?
en.wikipedia.org/wiki/Avalanche_effect
Oct
7
comment Session based AES with random key and static salt
Is this in addition to or instead of SSL? Is the RSA key embedded in the application?
Oct
2
comment Is deniable error-correction possible?
Given a set of words $W$ and the noise profile of the channel it's easy to calculate the probability that some received message $w'$ was originally broadcast as a word in $W$. That seems too simple, but I don't see any other way to interpret your question if nothing is secret and there's only 1 message sent.
Oct
2
answered Is deniable error-correction possible?
Sep
24
awarded  Autobiographer
Sep
19
awarded  Citizen Patrol