An implementation for a fast public-key cryptosystem

DOI10.1007/BF00196789zbMath0725.94002MaRDI QIDQ2277427

I. M. Onyszchuk, G. B. Agnew, Scott A. Vanstone, Ronald C. Mullin

Publication date: 1991

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

multiplicationpublic-key cryptographyVLSI implementationnormal basisGalois fieldcircuit architectureexponentiation in fields

Mathematics Subject Classification ID

Related Items (24)

Existence of some special primitive normal elements over finite fields ⋮ Finite field arithmetic using quasi-normal bases ⋮ A note on the distribution of self-dual normal bases generators of finite fields under trace map ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Complexity of computation in finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Primitive normal values of rational functions over finite fields ⋮ On primitive normal elements over finite fields ⋮ Gauss periods: orders and cryptographical applications ⋮ Computing low-weight discrete logarithms ⋮ Existence of primitive normal pairs with one prescribed trace over finite fields ⋮ WG: a family of stream ciphers with designed randomness properties ⋮ On the self-dual normal bases and their distribution ⋮ Abelian groups, Gauss periods, and normal bases ⋮ On Orders of Optimal Normal Basis Generators ⋮ Arithmetic operations in \(GF(2^ m)\) ⋮ On the complexity of the normal bases via prime Gauss period over finite fields ⋮ Normal bases and their dual-bases over finite fields ⋮ On a family of preimage-resistant functions ⋮ Algorithms for exponentiation in finite fields ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) ⋮ Elliptic curve cryptosystems and their implementation ⋮ Trace-orthogonal normal bases ⋮ On the existence of pairs of primitive normal elements over finite fields

Cites Work

• Low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Arithmetic operations in \(GF(2^ m)\)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Primitive Normal Bases for Finite Fields
• Cryptography
• Unnamed Item

This page was built for publication: An implementation for a fast public-key cryptosystem