Open AccessJournal Article
Doing more with fewer bits
54
TL;DR: In this paper, the authors presented a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical DiffieHellman, while the offered security against attacks known today is the same.
read more
Abstract: We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered security against attacks known today is the same We also give applications for this variant and conjecture a extension of this variant further reducing the size of sent information
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Protocols for Authentication and Key Establishment
Colin Boyd,Anish Mathuria +1 more
- 08 Aug 2003
TL;DR: This is the first comprehensive and integrated treatment of protocols for authentication and key establishment, which allows researchers and practitioners to quickly access a protocol for their needs and become aware of existing protocols which have been broken in the literature.
786
The XTR Public Key System
Arjen K. Lenstra,Eric R. Verheul +1 more
- 20 Aug 2000
TL;DR: The XTR public key system as discussed by the authors is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field, which leads to substantial savings both in communication and computational overhead without compromising security.
Torus-Based Cryptography
Karl Rubin,Alice Silverberg +1 more
- 17 Aug 2003
TL;DR: The concept of torus-based cryptography is introduced, a new public key system called CEILIDH is given, and other discrete log based systems including Lucas-based systems and XTR are compared.
•Journal Article
The function field sieve in the medium prime case
Antoine Joux,Reynald Lercier +1 more
TL;DR: This approach is an alternative to a recent paper of Granger and Vercauteren for computing discrete logarithms in tori, using efficient torus representations, and shows that when q is not too large, a very efficient L(1/3) variation of the function field sieve can be used.
101
•Journal Article
Torus-based cryptography
Karl Rubin,Alice Silverberg +1 more
TL;DR: In this paper, the authors introduce the concept of torus-based cryptography, give a new public key system called CEILIDH, and compare it to other discrete log based systems including Lucas-based systems and XTR.
91
References
Fast evaluation of logarithms in fields of characteristic two
TL;DR: The ideas give a dramatic improvement even for moderate-sized fields such as GF (2^{127}) , and make (barely) possible computations in fields of size around 2^{400} .
A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms
Peter K. Smith,Chris J. Skinner +1 more
- 28 Nov 1994
TL;DR: Lucas functions can be used to replace exponentiation to produce alternative cryptosystems that are not susceptible to attacks which rely on the fact that multiplication is closed under exponentiation, since Lucas functions do not exhibit this closure.
128
•Journal Article
Generating RSA moduli with a predetermined portion
TL;DR: In this paper, the authors present a method to generate RSA moduli with a predetermined portion of the RSA cryptosystem. The potential advantages of the resulting methods are discussed: both the storage and the computational requirements of RSA can be considerably reduced, and the resulting moduli do not seem to offer less security than regular RSA.
97
A subexponential algorithm for discrete logarithms over all finite fields
Leonard M. Adleman,Jonathan DeMarrais +1 more
- 22 Aug 1993
TL;DR: An algorithm and a heuristic argument that there exists a c ?
Some Remarks on Lucas-Based Cryptosystems
Daniel Bleichenbacher,Wieb Bosma,Arjen K. Lenstra +2 more
- 27 Aug 1995
TL;DR: The well-known relation between Lucas sequences and exponentiation is reviewed, and it is shown that certain public-key cryptosystems that are based on the use of Lucas sequences have some elementary properties their re-inventors were apparently not aware of.