Storage-efficient finite field basis conversion

DOI10.1007/3-540-48892-8_7MaRDI QIDQ4250808zbMATH OpenFDO

Authors Burton S. jun. Kaliski, Yiqun Lisa Yin

Publication date 8 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48892-8_7

zbMATH Keywords

algorithmscryptographic applicationsfinite field basis conversionstorage requirement

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Free storage basis conversion over finite fields
• scientific article; zbMATH DE number 1504806
• Finite field basis conversion and normal basis in characteristic three
• An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

Cited in

(6)

• An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
• Constructing composite field representations for efficient conversion
• A Storage-Efficient WY Representation for Products of Householder Transformations
• scientific article; zbMATH DE number 1504806 (Why is no real title available?)
• Free storage basis conversion over finite fields
• Finite field basis conversion and normal basis in characteristic three

This page was built for publication: Storage-efficient finite field basis conversion

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