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