Doing more with fewer bits

DOI10.1007/978-3-540-48000-6_26MaRDI QIDQ4502510zbMATH OpenFDO

Authors Ruud Pellikaan, Eric R. Verheul, Andries E. Brouwer

Publication date 12 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-48000-6_26

zbMATH Keywords

cryptosystemsDiffie-Hellman schemeLucas sequence

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the bit security of elliptic curve Diffie-Hellman
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• A one round protocol for tripartite Diffie-Hellman
• A one round protocol for tripartite Diffie-Hellman
• scientific article; zbMATH DE number 3948147

Cited in

(9)

• Applications to cryptography of twisting commutative algebraic groups
• Security of polynomial transformations of the Diffie-Hellman key.
• How McFadden met Rockafellar and learned to do more with less
• Algebraic generalization of Diffie-Hellman key exchange
• Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
• A research on new public-key encryption schemes
• Effective compression maps for torus-based cryptography
• The Function Field Sieve in the Medium Prime Case
• XTR algorithm: efficient and compact subgroup trace representation

This page was built for publication: Doing more with fewer bits

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