Efficient systolic multiplications in composite fields for cryptographic systems

DOI10.3934/DCDSS.2019078MaRDI QIDQ2321671zbMATH OpenOpenAlexWikidataFDO

Authors Haibo Yi

Publication date 23 August 2019

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

composite fieldfinite fieldmultiplicationmultipliersystolic

Mathematics Subject Classification ID

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

Recommendations

• Fast arithmetic for public-key algorithms in Galois fields with composite exponents
• Fast scalar multiplications on hyperelliptic curve cryptosystems
• scientific article; zbMATH DE number 1878332
• scientific article; zbMATH DE number 2118995
• scientific article; zbMATH DE number 1839433
• Progress in Cryptology - INDOCRYPT 2003
• Efficient hardware implementation of finite fields with applications to cryptography
• Efficient scalar multiplication for elliptic curves over binary fields

Cites work

• A new algorithm for multiplication in finite fields
• A Very Compact S-Box for AES
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Comb Architectures for Finite Field Multiplication in F(2ᵐ)
• Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields
• Decoding of Reed Solomon codes beyond the error-correction bound
• Good error-correcting codes based on very sparse matrices
• High-speed hardware implementation of Rainbow signature on FPGAs
• scientific article; zbMATH DE number 17850 (Why is no real title available?)
• scientific article; zbMATH DE number 2080690 (Why is no real title available?)
• scientific article; zbMATH DE number 2081069 (Why is no real title available?)
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)
• Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Neural networks for solving systems of linear equations and related problems
• Selecting parameters for the Rainbow signature scheme
• The 128-Bit Blockcipher CLEFIA (Extended Abstract)

Cited in

(3)

• Look-up table-based large finite field multiplication in memory constrained cryptosystems
• scientific article; zbMATH DE number 1878332 (Why is no real title available?)
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)

Describes a project that uses

Uses Software

• CLEFIA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321671)