Gauss periods: orders and cryptographical applications

DOI10.1090/S0025-5718-98-00935-1zbMath1036.11530MaRDI QIDQ4372701

Joachim von zur Gathen, Daniel Panario, Shuhong Gao

Publication date: 16 December 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

normal basesprimitive elementscryptographyFinite fieldspseudorandom bit generators

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (14)

Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ A class of Gaussian normal bases and their dual bases ⋮ Fast arithmetic with general Gauß periods ⋮ On the existence of some specific elements in finite fields of characteristic 2 ⋮ The index calculus method using non-smooth polynomials ⋮ Gauss periods as constructions of low complexity normal bases ⋮ Abelian groups, Gauss periods, and normal bases ⋮ Primitive elements with prescribed trace ⋮ MULTIPLICATIVE ORDER OF GAUSS PERIODS ⋮ Normal bases and their dual-bases over finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Finite field elements of high order arising from modular curves ⋮ Primitive elements with prescribed traces ⋮ Algorithms for exponentiation in finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal normal bases in \(GF(p^ n)\)
• Efficient signature generation by smart cards
• Orders of Gauss periods in finite fields
• An implementation for a fast public-key cryptosystem
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A public key cryptosystem and a signature scheme based on discrete logarithms
• The Discrete Logarithm Hides $O(\log n)$ Bits
• New directions in cryptography
• Primitive Polynomials Over Finite Fields
• A Table of Primitive Binary Polynomials
• Table of Primitive Binary Polynomials. II
• Primitive Normal Polynomials Over Finite Fields
• On Orders of Optimal Normal Basis Generators
• On primitive trinomials (Mod 2)
• On primitive trinomials (mod 2), II
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

This page was built for publication: Gauss periods: orders and cryptographical applications