scientific article; zbMATH DE number 1424173

MaRDI QIDQ4945370zbMATH OpenFDO

Authors

Publication date 18 March 2002

zbMATH Keywords

algorithmlook-up tablememory constrained cryptosystemsmultiplication

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to information and communication theory (94-04) Cryptography (94A60)

Recommendations

• Look-up table-based large finite field multiplication in memory constrained cryptosystems
• Efficient hardware implementation of finite fields with applications to cryptography
• Efficient systolic multiplications in composite fields for cryptographic systems
• Low complexity bit-parallel multipliers for a class of finite fields
• scientific article; zbMATH DE number 1878331
• Efficient finite field multiplication for isogeny based post quantum cryptography
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• scientific article; zbMATH DE number 1759300
• Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems

Cited in

(6)

• A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \)
• Efficient systolic multiplications in composite fields for cryptographic systems
• Construction of logarithm tables for Galois fields
• Implementing multiplication with split read-only memory
• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields
• Look-up table-based large finite field multiplication in memory constrained cryptosystems

This page was built for publication:

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