On a quick multiplication in normal bases of finite fields

DOI10.1515/DMA.2001.11.4.327MaRDI QIDQ4809530zbMATH OpenOpenAlexFDO

Authors A. A. Bolotov, S. B. Gashkov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2001.11.4.327

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20)

Cited in

(7)

• Fast algorithm of square rooting in some finite fields of odd characteristic
• On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
• Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
• On design of circuits of logarithmic depth for inversion in finite fields
• Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
• Efficient normal basis multipliers in composite fields
• Complexity of computation in finite fields

This page was built for publication: On a quick multiplication in normal bases of finite fields

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