VLSI-implementering av en generell exponentierare över stora galoiskroppar
1992 (Swedish)Other (Other (popular science, discussion, etc.))
An important operation in certain cryptosystems is exponentiation in large galois fields, which can be achieved by multiplication and squaring. This report deals first with the theory of Galois fields, and then with a number of architectures for multiplication, squaring and exponentiation in Galois fields. Various bases for Galois fields yield architectures with different degrees of regularity. Since the polynomial basis yields the best known architectures as far as performance, complexity and structure are concerned, we discuss solely this basis. We also present a VLSI implementation of a universal exponentiator over GF(2^m), m<337, which we use to study expected performance, complexity, chip size and power consumption as a function of m for an arbitrary exponentiator. An important conclusion is that the performance is not limited by the critical paath, but by the distribution of signals needed all over the chip. We also arrived at the conclusion that it is perfectly possible today to expand the exponentiator to m<1001.
Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 1992.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-42342Local ID: 62689OAI: oai:DiVA.org:liu-42342DiVA: diva2:263198