« first day (3595 days earlier)      last day (69 days later) » 

5:39 AM
1
Q: Can all affine cyphers be expressed with this formula

mark markThere are $26!$ permutations of English alphabet. In Modern Cryptography textbook, William Easttom states that the basic formula for any affine cipher is $ax + b \equiv (mod \space26)$. I'm wondering whether this formula can express every possible permutation. It does not seem obvious that for ...

 
 
2 hours later…
7:15 AM
@kelalaka Nice! Tough perhaps a little on the fast side for my eye.
 
 
2 hours later…
9:33 AM
    @fgrieu It is just the convert of the ImageMagick command
convert -delay 50 -loop 0 lfsr-*.png lfsr.gif
 
9:45 AM
double time -delay 100 will be fine?
 
 
2 hours later…
12:06 PM
It is a perfect loop. All of the period is there, and repeats :)
 
 
4 hours later…
3:50 PM
@kelalaka you could have a self-clocking cypher or an asynchronous clocked cipher. I have an asynchronous version of SIMON.
I think it's all down to semantics. I would expect every cipher to be "clocked" because you have some synchronization between the key schedule and data. It's something so obvious, I don't know why it's even mentioned, which is why I was wondering if clocked meant something else.
 
4:11 PM
I think it's all down to semantics.
 

« first day (3595 days earlier)      last day (69 days later) »