Systolic Gaussian Elimination Over GF(p) with Partial Pivoting
IEEE Transactions on Computers
A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2/sup m/)
IEEE Transactions on Computers
VLSI Designs for Multiplication over Finite Fields GF (2m)
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Multivariate Public Key Cryptosystems (Advances in Information Security)
Multivariate Public Key Cryptosystems (Advances in Information Security)
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and lIC-Derivatives
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Fast Multivariate Signature Generation in Hardware: The Case of Rainbow
FCCM '08 Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing Machines
SSE Implementation of Multivariate PKCs on Modern x86 CPUs
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
New differential-algebraic attacks and reparametrization of rainbow
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Rainbow, a new multivariable polynomial signature scheme
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Implementing minimized multivariate PKC on low-resource embedded systems
SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing
Efficient implementations of MQPKS on constrained devices
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Towards provably secure proxy signature scheme based on Isomorphisms of Polynomials
Future Generation Computer Systems
Hi-index | 0.00 |
We propose a new efficient hardware implementation of Rainbow signature scheme. We enhance the implementation in three directions. First, we develop a new parallel hardware design for the Gauss-Jordan elimination, and solve a 12 ×12 system of linear equations with only 12 clock cycles. Second, a novel multiplier is designed to speed up multiplication of three elements over a finite field. Third, we design a novel partial multiplicative inverter to speed up the multiplicative inversion of finite field elements. Through further other minor optimizations of the parallelization process and by integrating the major optimizations above, we build a new hardware implementation, which takes only 198 clock cycles to generate a Rainbow signature, a new record in generating digital signatures and four times faster than the 804-clock-cycle Balasubramanian-Bogdanov-Carter-Ding-Rupp design with similar parameters.