An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

DOI10.1109/TC.2005.124zbMATH Open1231.68044MaRDI QIDQ3417028

Berk Sunar

Publication date: 9 January 2007

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

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)

Related Items (3)

A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields ⋮ Title not available (Why is that?) ⋮ Free storage basis conversion over finite fields

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)