scientific article; zbMATH DE number 424718
From MaRDI portal
Publication:3136478
codesdiscrete logarithm problemelliptic curve cryptosystemselliptic curves over finite fieldsfactoring of polynomialsfinite field arithmeticfinite fieldsirreducible polynomialsnormal basisoptimal normal basessurvey
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Curves over finite and local fields (11G20) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Elliptic curves (14H52) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Recommendations
Cited in
(only showing first 100 items - show all)- Elliptic curve based hardware architecture using cellular automata
- Density of normal elements
- Factorization of polynomials and some linear-algebra problems over finite fields
- Almost weakly self-dual bases for finite fields
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
- Low complexity normal bases in \(\mathbb F_{2^n}\)
- Algorithms for exponentiation in finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Fast operations on linearized polynomials and their applications in coding theory
- High-performance generic-point parallel scalar multiplication
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
- Normal bases and irreducible polynomials
- Finite fields: theory and applications
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Finite fields and cryptology
- Explicit N-polynomials of 2-power degree over finite fields. I
- Irreducible compositions of polynomials over finite fields of even characteristic
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- On the dimension of the subfield subcodes of 1-point Hermitian codes
- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
- Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\)
- On the Menezes-Teske-Weng conjecture
- Existence and cardinality of \(k\)-normal elements in finite fields
- On the self-dual normal bases and their distribution
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- Existence of some special primitive normal elements over finite fields
- Finite field arithmetic using quasi-normal bases
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- Prescribing coefficients of invariant irreducible polynomials
- Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
- A new characterization of dual bases in finite fields and its applications
- Self-reciprocal irreducible pentanomials over \(\mathbb F_2\)
- Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
- Normal bases and their dual-bases over finite fields
- A note on composed products of polynomials over finite fields
- Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\)
- A note on the reducibility of binary affine polynomials
- Maximum distance separable codes based on circulant Cauchy matrices
- Some notes on the k-normal elements and k-normal polynomials over finite fields
- A note on the distribution of self-dual normal bases generators of finite fields under trace map
- scientific article; zbMATH DE number 426144 (Why is no real title available?)
- scientific article; zbMATH DE number 7228861 (Why is no real title available?)
- scientific article; zbMATH DE number 3961485 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 19618 (Why is no real title available?)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- The Gaussian normal basis and its trace basis over finite fields
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- Gauss periods: orders and cryptographical applications
- Recursive constructions of irreducible polynomials over finite fields
- An explicit description of the set of all normal bases generators of a finite field
- On primitive normal elements over finite fields
- Free storage basis conversion over finite fields
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- Computing special powers in finite fields
- On Orders of Optimal Normal Basis Generators
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- Complexities of self-dual normal bases
- A new construction of anticode-optimal Grassmannian codes
- Newly reducible polynomial iterates
- Recursive construction of normal polynomials over finite fields
- A class of Gaussian normal bases and their dual bases
- Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
- Topics in Galois Fields
- Construction of primitive polynomials over finite fields
- Function fields over finite fields and their applications to cryptography
- Finite fields and applications
- Construction of irreducible polynomials over finite fields
- Finite fields. Understanding, calculation, application
- Finite fields. Understanding, calculation, application
- Abelian groups, Gauss periods, and normal bases
- On the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) over finite fields
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Fast arithmetic with general Gauß periods
- Constructions of irreducible polynomials over finite fields with even characteristic
- Low complexity of a class of normal bases over finite fields
- Quaternary 1-generator quasi-cyclic codes
- Irreducible compositions of polynomials over finite fields
- Complex matrix inversion via real matrix inversions
- The R-transform as power map and its generalizations to higher degree
- Specific irreducible polynomials with linearly independent roots over finite fields
- Towards the security of McEliece's cryptosystem based on Hermitian subfield subcodes
- On the functions which are CCZ-equivalent but not EA-equivalent to quadratic functions over \(\mathbb{F}_{p^n}\)
- Construction of self-dual normal bases and their complexity
- Finite fields and their applications. Proceedings of the 14th international conference on finite fields and their applications (Fq14), Vancouver, Canada, June 3--7, 2019
- On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime
- Formulas for cube roots in \(\mathbb F_{3^m}\)
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Guest editorial: Special issue in honor of Scott A. Vanstone
- A survey of some applications of finite fields
- On the complexity of the dual basis of a type I optimal normal basis
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
- A shorter proof for an explicit formula for discrete logarithms in finite fields
- A method for constructing a self-dual normal basis in odd characteristic extension fields
- Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials
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 Q3136478)
