Speeding up Subgroup Cryptosystems proefschrift

@inproceedings{Stam2003SpeedingUS,
  title={Speeding up Subgroup Cryptosystems proefschrift},
  author={Martijn Stam},
  year={2003}
}
Preface The title of this thesis contains the word cryptosystem. Originally cryptosys-tems were used to make messages unintelligible for prying eyes; only the intended receiver could make up what the message said. In the very early beginnings this could be done by heart, then by hand using pencil and paper and later using tables and sophisticated mechanical devices. Today computers are used most of the times to implement cryptosystems that can provide confidentiality but also authenticity and… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

A note on schoenmakers algorithm for multi exponentiation

2015 12th International Joint Conference on e-Business and Telecommunications (ICETE) • 2015
View 4 Excerpts
Highly Influenced

Faster Compact Diffie-Hellman: Endomorphisms on the x-line

IACR Cryptology ePrint Archive • 2013
View 4 Excerpts
Highly Influenced

High Security Pairing-Based Cryptography Revisited

IACR Cryptology ePrint Archive • 2006
View 10 Excerpts
Highly Influenced

Montgomery curves and their arithmetic

Journal of Cryptographic Engineering • 2017

References

Publications referenced by this paper.
Showing 1-10 of 164 references

Computing short Lucas chains for elliptic curve cryptosystems

Y. Tsuruoka
IEICE Trans. Fundamentals, E84–A(5):1227–1233 • 2001
View 4 Excerpts
Highly Influenced

Multidigit multiplication for mathematicians

D. J. Bernstein
To appear in Advances of Applied Mathematics • 2000
View 5 Excerpts
Highly Influenced

The XTR Public Key System

View 20 Excerpts
Highly Influenced

Efficiency and Security of Cryptosystems based on Number Theory

D. Bleichenbacher
PhD thesis, ETH Zürich • 1996
View 16 Excerpts
Highly Influenced

Efficient and optimal exponentiation in finite fields

computational complexity • 1991
View 5 Excerpts
Highly Influenced

Son of seminumerical algorithms

ACM SIGSAM Bulletin • 1975
View 20 Excerpts
Highly Influenced

Torus-Based Cryptography

View 5 Excerpts
Highly Influenced

On multi-exponentiation in cryptography

IACR Cryptology ePrint Archive • 2002
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…