Abstract. Gabidulin has proposed a version of the McEliece Public Key Cryptosystem using what he calls maximum rank distance (MRD) codes in place of Goppa codes. It is shown how to break such a system by finding a trapdoor to it. For the size of code he suggests this can be done in about a week on a fast personal computer. The attack can be thwarted by increasing the size of the code, but the advantages claimed for the Gabidulin version over the MeEliece version are then largely lost.

No abstract

No abstract

No abstract

Abstract.BrickeWs algorithm finds A x Bmod C for n-bit integers A, B, C, using O(n) hardware to achieve an O(n) running time. This paper gives a generalisation of his algorithm, and presents a proof, missing from Brickell's paper, that it works, showing the existence of other similar schemes.