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