Design and diagnosis of galois logic networks.
Design and diagnosis of galois logic networks.
Reed-Muller Like Canonic Forms for Multivalued Functions
IEEE Transactions on Computers
A Transform for Logic Networks
IEEE Transactions on Computers
On functions of linear shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Low-complexity bit-parallel systolic multipliers over GF(2m)
Integration, the VLSI Journal
Divided Difference Methods for Galois Switching Functions
IEEE Transactions on Computers
A Theory of Galois Switching Functions
IEEE Transactions on Computers
Synthesis of Finite State Algorithms in a Galois Field GF[pn]
IEEE Transactions on Computers
Systolic Multipliers for Finite Fields GF(2m)
IEEE Transactions on Computers
On the Fundamental Structure of Galois Switching Functions
IEEE Transactions on Computers
Multiplexer-based bit-parallel systolic multipliers over GF(2m)
Computers and Electrical Engineering
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
Computers and Electrical Engineering
Systolic product-sum circuit for GF((22)m) using neuron MOSFETs
Integration, the VLSI Journal
Systolic Galois field exponentiation in a multiple-valued logic technique
Integration, the VLSI Journal
Generation of binary sequences with controllable complexity and ideal γ-tupel distribution
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 15.00 |
The Boolean difference expansion of Boolean algebra is generalized to finite (Galois) fields. A systematic method is provided for calculating the coefficients of this type of multivariable polynomial expansion. It is applied then to the synthesis functions. Applications include multivalued logics as well as binary-valued logics.