UNIFIED MULTIPLIER FOR THE FINITE FIELDS GF(2N) AND GF(P), CRYPTOGRAPHIC METHOD, AND CRYPTOGRAPHIC DEVICE

摘要

The invention relates to a device for determining a product C of two factors in the form of finite bit sequences A = an-1an-2...a1a0 and B = bn-1bn-2...b1b0 as a product optionally in the Galois field GF(p) or as a product in the Galois field GF(2n). The invention also relates to cryptographic methods and devices.