Look-up table-based large finite field multiplication in memory constrained cryptosystems

DOI10.1109/12.863045MaRDI QIDQ4571367zbMATH OpenOpenAlexFDO

Authors M. Anwar Hasan

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.863045

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1424173
• Efficient hardware implementation of finite fields with applications to cryptography
• Low complexity bit-parallel multipliers for a class of finite fields
• Efficient systolic multiplications in composite fields for cryptographic systems
• Efficient finite field multiplication for isogeny based post quantum cryptography
• Faster secure multi-party computation of AES and DES using lookup tables
• Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
• scientific article; zbMATH DE number 1878331
• Improved side-channel analysis of finite-field multiplication
• Efficient lookup-table protocol in secure multiparty computation

Cited in

(3)

• Performance of algebraic graphs based stream-ciphers using large finite fields
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)

This page was built for publication: Look-up table-based large finite field multiplication in memory constrained cryptosystems

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