Efficient systolic multiplications in composite fields for cryptographic systems

DOI10.3934/dcdss.2019078zbMath1419.94053OpenAlexW2901141617WikidataQ128861998 ScholiaQ128861998MaRDI QIDQ2321671

Haibo Yi

Publication date: 23 August 2019

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdss.2019078

zbMATH Keywords

finite fieldmultiplicationmultipliercomposite fieldsystolic

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Uses Software

• CLEFIA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding of Reed Solomon codes beyond the error-correction bound
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• A new algorithm for multiplication in finite fields
• High-Speed Hardware Implementation of Rainbow Signature on FPGAs
• A Very Compact S-Box for AES
• The 128-Bit Blockcipher CLEFIA (Extended Abstract)
• Selecting Parameters for the Rainbow Signature Scheme
• Neural networks for solving systems of linear equations and related problems
• Comb Architectures for Finite Field Multiplication in F(2^m)
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Good error-correcting codes based on very sparse matrices
• Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials
• Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields

This page was built for publication: Efficient systolic multiplications in composite fields for cryptographic systems