Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
- 15 April 2001
- book chapter
- Published by Springer Nature
- p. 195-210
- https://doi.org/10.1007/3-540-44987-6_13
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fast Irreducibility and Subgroup Membership Testing in XTRPublished by Springer Nature ,2001
- Key Improvements to XTRPublished by Springer Nature ,2000
- A One Round Protocol for Tripartite Diffie–HellmanPublished by Springer Nature ,2000
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone AlgorithmJournal of Cryptology, 1998
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackPublished by Springer Nature ,1998
- An elliptic curve implementation of the finite field digital signature algorithmPublished by Springer Nature ,1998
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Elliptic Curve Public Key CryptosystemsPublished by Springer Nature ,1993
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978