Still have the idea that a CSA BF in 10 sec would change a lot
Just wanted to know if there are any new findings or idea to the CSA Brute Force which can reduce the key space lower than 2^48?
As far I know you still need
56 rounds of BC
32 rounds of SC init and
12 rounds of SC run could be stopped if result are wrong (easy in software hard in hardware if fully unrolled / pipeline core on fpga are used)
I'm aware of RBT, but I doubt a c8 for 10 sec will tell you what to search for. This problem point back to normal BF approach.
It's possible to do a complete 2^48 BF search in about 12 hours on 1 FPGA, but to reach 10 sec. you will need about 4500 chips = not possible.
Come with your great ideas
Just wanted to know if there are any new findings or idea to the CSA Brute Force which can reduce the key space lower than 2^48?
As far I know you still need
56 rounds of BC
32 rounds of SC init and
12 rounds of SC run could be stopped if result are wrong (easy in software hard in hardware if fully unrolled / pipeline core on fpga are used)
I'm aware of RBT, but I doubt a c8 for 10 sec will tell you what to search for. This problem point back to normal BF approach.
It's possible to do a complete 2^48 BF search in about 12 hours on 1 FPGA, but to reach 10 sec. you will need about 4500 chips = not possible.
Come with your great ideas