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 = a_n-1a_n-2...a₁a₀ and B = b_n-1b_n-2...b₁b₀ as a product optionally in the Galois field GF(p) or as a product in the Galois field GF(2ⁿ). The invention also relates to cryptographic methods and devices.