IEEE Transactions on Computers · 2011 · 11 citations · 20 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureCryptographyTheory Of ComputationBoolean AlgebraCircuit ComplexityCombinational Logic DescriptionDigital Logic DesignLogic SynthesisLookup TablesArithmetic Circuit EvaluationArithmetic Circuit SynthesisCombinational Logic SynthesisCryptographic ApplicationsFinite Field ArithmeticLogic OptimizationMulti-level Logic DesignMulti-level Logic Synthesis
The choice of radix is crucial for multivalued logic synthesis. Practical examples, however, reveal that it is not always possible to find the optimal radix when taking into consideration actual physical parameters of multivalued operations. In other words, each radix has its advantages and disadvantages. Our proposal is to synthesize logic in different radices, so it may benefit from their combination. The theory presented in this paper is based on Reed-Muller expansions over Galois field arithmetic. The work aims to first estimate the potential of the new approach and to second analyze its impact on circuit parameters down to the level of physical gates. The presented theory has been applied to real-life examples focusing on cryptographic circuits where Galois Fields find frequent application. The benchmark results show that the approach creates a new dimension for the trade-off between circuit parameters and provides information on how the implemented functions are related to different radices.
20
Improving smart card security using self-timed circuits
Simon W. Moore, Ross Anderson, P. Cunningham et al. · 2004 · 182 citations
Computation with finite fields
Thomas C. Bartee, David Schneider · Information and Control · 1963 · 117 citations
Delay-insensitive, point-to-point interconnect using m-of-n codes
W.J. Bainbridge, William Toms, D. Edwards et al. · 2003 · 105 citations