Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)

DOI10.1016/J.IPL.2017.12.002zbMath1427.11145OpenAlexW2772513563MaRDI QIDQ1705651

L. Boppre Niehues, Daniel Panario, Ricardo F. Custódio

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.12.002

zbMATH Keywords

finite fieldcryptographypolynomialsquaring

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Dual EC: A Standardized Back Door
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
• Information Security and Privacy

This page was built for publication: Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)