An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

DOI10.1109/TC.2005.124MaRDI QIDQ3417028zbMATH OpenFDO

Authors Berk Sunar

Publication date 9 January 2007

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

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

zbMATH Keywords

polynomial factorizationrandomized polynomial time algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Randomized algorithms (68W20)

Recommendations

• Constructing composite field representations for efficient conversion
• scientific article; zbMATH DE number 1504806
• scientific article; zbMATH DE number 1273656
• Free storage basis conversion over finite fields
• scientific article; zbMATH DE number 1304110

Cited in

(6)

• Constructing composite field representations for efficient conversion
• scientific article; zbMATH DE number 1304110 (Why is no real title available?)
• scientific article; zbMATH DE number 1504806 (Why is no real title available?)
• A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
• Free storage basis conversion over finite fields
• Finite field basis conversion and normal basis in characteristic three

This page was built for publication: An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

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