On the Time Required to Perform Multiplication
Journal of the ACM (JACM)
Unateness Properties of and-Exclusive-or Logic Circuits
IEEE Transactions on Computers
Reed-Muller Like Canonic Forms for Multivalued Functions
IEEE Transactions on Computers
Minimization of Exclusive or and Logical Equivalence Switching Circuits
IEEE Transactions on Computers
A Transform for Logic Networks
IEEE Transactions on Computers
The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions
IEEE Transactions on Computers
Reed-Muller Canonical Forms in Multivalued Logic
IEEE Transactions on Computers
Easily Testable Realizations ror Logic Functions
IEEE Transactions on Computers
A Cellular-Array Multiplier for GF(2m)
IEEE Transactions on Computers
Galois Switching Functions and Their Applications
IEEE Transactions on Computers
Procedures for minimization of "Exclusive-or" and "Logical-equivalence" switching circuits
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Mathematical framework for representing discrete functions as word-level polynomials
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimization of polynomial datapaths using finite ring algebra
ACM Transactions on Design Automation of Electronic Systems (TODAES)
C-testable bit parallel multipliers over GF(2m)
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis of Finite State Algorithms in a Galois Field GF[pn]
IEEE Transactions on Computers
On the Fundamental Structure of Galois Switching Functions
IEEE Transactions on Computers
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Theory of Quantum Computation, Communication, and Cryptography
Transition faults detection in bit parallel multipliers over GF(2m)
WSEAS Transactions on Circuits and Systems
An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)a
Quantum Information & Computation
| Hi-index | 14.99 |
Galois switching functions (GSF's) are generalizations of binary functions in that the input and output variables can assume values over any finite field. The concepts of minterms, k-cubes and minimal complexity realizations as related to GSF are introduced.