An implementation for a fast public-key cryptosystem

DOI10.1007/BF00196789zbMATH Open0725.94002MaRDI QIDQ2277427FDOQ2277427

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

Publication date: 1991

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

Recommendations

• scientific article; zbMATH DE number 545390
• scientific article; zbMATH DE number 1024035
• A systolic, high speed architecture for an RSA cryptosystem
• scientific article; zbMATH DE number 503341
• scientific article; zbMATH DE number 4191556

zbMATH Keywords

multiplicationnormal basispublic-key cryptographyGalois fieldVLSI implementationcircuit architectureexponentiation in fields

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (36)

• An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism
• Arithmetic operations in \(GF(2^ m)\)
• Title not available (Why is that?)
• Gauss periods: orders and cryptographical applications
• On a family of preimage-resistant functions
• Architectures for exponentiation in GF(2n)
• Computing low-weight discrete logarithms
• On Orders of Optimal Normal Basis Generators
• Finite field arithmetic using quasi-normal bases
• Title not available (Why is that?)
• Algorithms for exponentiation in finite fields
• On the complexity of the normal bases via prime Gauss period over finite fields
• On primitive normal elements over finite fields
• WG: a family of stream ciphers with designed randomness properties
• A note on the distribution of self-dual normal bases generators of finite fields under trace map
• On the existence of pairs of primitive normal elements over finite fields
• Guest editorial: Special issue in honor of Scott A. Vanstone
• Trace-orthogonal normal bases
• Title not available (Why is that?)
• Fast Exponentiaion over GF(2m) Based on Cellular Automata
• Existence of some special primitive normal elements over finite fields
• Primitive normal values of rational functions over finite fields
• Elliptic curve cryptosystems and their implementation
• Title not available (Why is that?)
• Reusing nonces in Schnorr signatures (and keeping it secure...)
• Abelian groups, Gauss periods, and normal bases
• Normal bases and their dual-bases over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)
• Arithmetic progression in a finite field with prescribed norms
• Existence of primitive normal pairs with one prescribed trace over finite fields
• On the self-dual normal bases and their distribution
• Complexity of computation in finite fields
• Testing the speed of algorithms and programs implementing the basic operations of asymmetric cryptography

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277427)