Algebraic circuits (Q2452726)

The book under review presents the mathematical foundations and also the most relevant algebraic circuits. For this reason, it can be considered as a good reference in this field. Chapter 1, Number Systems, presents various representations used for integer numbers and also the main procedures for the implementation of the basic arithmetic operations: addition, subtraction, multiplication, division, and square root. Chapter 2 is dedicated to the description of simple circuits for the implementation of some of the arithmetic operations presented in the first chapter and also for some new operations. So, the design of adders, subtractors, multipliers, divisors, comparators and shifters are studied. The arithmetic circuits presented in this chapter will be used in the next chapters for the implementation of algebraic circuits. Chapter 3, presents residue number systems, which are useful for computation-intensive applications, especially those related to signal processing. Also, the Galois Fields \(\text{GF}(p)\) are introduced in this chapter, because the modular operations when \(p\) is prime are those to be implemented for \(\text{GF}(p)\), which are the objective of the following chapters. Chapter 4 is devoted to basic algebraic circuits: linear feedback shift registers, LFSR, and cellular automata, CA. First, the classic circuits are introduced, circuits called LFSRmod2, that in each cell store a single bit. These circuits are generalized to LFSRmod\(2^m\), LFSRmodp, and LFSRmodp\(^m\), with \(p\) a prime integer, circuits whose cells store digits with various bits. In the last part of the chapter the one-dimensional cellular automata are studied and the two-dimensional cellular automata are only defined. In the Chapter 5 the circuits based on the Galois fields \(\text{GF}(2^m)\) are presented. While the mathematical foundations of the finite fields are presented in the Appendices A and B, in this chapter some circuits for the more relevant operations over \(\text{GF}(2^m)\) are shown: addition, product, square, exponentiation, inversion, and division. These implementations are presented using power representation and the standard, normal, and dual basis. In the last section, the operations in the composite Galois fields \(\text{GF}((2^n)^m)\) are presented. Similarly with the Galois field \(\text{GF}(2^ m)\), in Chapter 6 the circuits related to the finite fields \(\text{GF}(p)\) and \(\text{GF}(p^m)\), \(p\) being prime, are presented. Some special cases for certain values \(p\) are detailed and also some operations in the composite \(\text{GF}((p^n)^m)\) are presented. In Chapter 7 two applications of the Galois fields in the public key cryptography are presented. The first is about the use of the Galois field \(\text{GF}(2^{233})\) in cryptography based on the discrete logarithm problem and the second one how the Galois field \(\text{GF}(2^{192}-2^{64}-1)\) is used for building a cryptosystem based on elliptic curves. In the last part 3 appendices are dedicated to mathematical fundamentals: Finite or Galois Fields, Polynomial Algebra and Elliptic Curves.