scientific article; zbMATH DE number 1273656
From MaRDI portal
Publication:4237386
Recommendations
Cited in
(26)- Optimal normal bases in \(GF(p^ n)\)
- Trace-orthogonal normal bases
- Low complexity normal bases in \(\mathbb F_{2^n}\)
- Normal basis exhaustive search: 10 years later
- A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)
- Normal bases from 1-dimensional algebraic groups
- Finite field arithmetic using quasi-normal bases
- Polynomial and normal bases for finite fields
- scientific article; zbMATH DE number 1583947 (Why is no real title available?)
- Finding a normal basis of a finite field in deterministic polynomial time
- Explicit construction of finite fields using normal bases
- A new algorithm for multiplication in finite fields
- An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
- Minimum complexity and low-weight normal polynomials over finite fields
- Low Complexity Normal Elements over Finite Fields of Characteristic Two
- О построении нормального базиса конечного поля
- scientific article; zbMATH DE number 4061359 (Why is no real title available?)
- scientific article; zbMATH DE number 2142533 (Why is no real title available?)
- scientific article; zbMATH DE number 812069 (Why is no real title available?)
- A survey on normal bases over finite fields
- On multiplication tables of optimal normal bases over finite fields
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- scientific article; zbMATH DE number 2188627 (Why is no real title available?)
- New deterministic algorithm for constructing normal bases in finite fields
- Low complexity normal bases for \(F_{2^{mn}}\)
- Low complexity normal bases
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4237386)
