New answers tagged

2

The problem with supersingular elliptic curves is that they're vulnerable to transfer attacks (which reduce the elliptic curve DLP into an additive or multiplicative group DLP) as explained on Bernstein's SafeCurves page. Fortunately, it's possible to build a one-way permutation using an arbitrary elliptic curve $E$ over the field $\mathbb{F}_p$. The trick ...


1

There might not be enough information about where in the algorithm your 56 bit key is found. If the 56 bit value B092EBA02E3798 represents the CD block following PC1 the keytab -s table shows selected key K16 is the result of applying PC2 to the CD block: Bit 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 KS 1 15 18 12 25 2 6 ...


Top 50 recent answers are included