Practical cryptography in high dimensional tori

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 234-250

  Van Dijk, Marten ^a   Granger, Robert ^b   Page, Dan ^b   Rubin, Karl ^c   Silverberg, Alice ^c   Stam, Martijn ^b   Woodruff, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Discrete log based cryptography; Torus based cryptography

Indexed keywords

ALGEBRA; BANDWIDTH; COMPUTATIONAL METHODS; DATA COMPRESSION; DATA STORAGE EQUIPMENT;

COMPRESSION FACTORS; DISCRETE-LOG BASED CRYPTOGRAPHY; MESSAGE DOMAIN; TORUS-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 24944495534     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_14     Document Type: Conference Paper

References (31)

1. R.M. Avanzi. Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. CHES'04, LNCS 3156, 148-162.
2. W. Bosma, J. Hutton and E. R. Verheul. Looking beyond XTR. Asiacrypt'02, LNCS 2501, 46-63.
3. A. Bosselaers, R. Govaerts and J. Vandewalle. Comparison of Three Modular Reduction Functions. Crypto'94, LNCS 773, 175-186.
4. A.E. Brouwer, R. Pellikaan and E.R. Verheul. Doing More with Fewer Bits. Asiacrypt'99, LNCS 1716, 321-332.
5. I. Damgard and M. Jurik. A Length-Flexible Threshold Cryptosystem with Applications ACISP'03, LNCS 2727, 350-364.
6. M. van Dijk and D. Woodruff. Asymptotically Optimal Communication for Torus-Based Cryptography. Crypto'04, LNCS 3152, 157-178.
7. S. Goldwasser and S. Micali. Probabilistic Encryption. In Comp. Sys. Sci, 28(1), 270-299, 1984.
8. P. Golle and A. Juels. Parallel Mixing. In Computer and Communications Security (CSS), ACM, 220-226, 2004.
9. R. Granger, D. Page, and M. Stam. A comparison of CEILIDH and XTR. ANTS-VI, LNCS 3076, 235-249, 2004.
10. m) Using Normal Bases. In Info. and Comp., 78(3), 171-177, 1988.
11. A. Kiayias and M. Yung. Self-Tallying Elections and Perfect Ballot Secrecy. PKC'02, LNCS 2274, 141-158.
12. A.A. Klyachko. On the Rationality of Tori with Cyclic Splitting Field (Russian). In Arithmetic and Geometry of Varieties, Kuybyshev Univ. Press, 73-78, 1988.
13. E. Kushilevitz and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Foundations of Computer Science (FOCS), IEEE Press, 364-373, 1997.
14. M.J.J. Lennon and P.J. Smith. LUC: A New Public Key System. In IFIP TC11 Ninth International Conference on Information Security IFIP/Sec, 103-117, 1993.
15. A.K. Lenstra and E.R. Verheul. The XTR Public Key System. Crypto'00, LNCS 1880, 1-19.
16. A.K. Lenstra and E.R. Verheul. An Overview of the XTR Public Key System. In Public-Key Cryptography and Computational Number Theory, Verlages Walter de Gruyter, 151-180, 2001.
17. P.L. Montgomery. Modular Multiplication Without Trial Division. In Math. Comp., 44, 519-521, 1985.
18. M. Nöcker. Data structures for parallel exponentiation in finite fields. PhD Thesis, Universität Paderborn, 2001.
19. P. Paillier. Public-key cryptosystems based on composite degree residuaosity classes. Eurocrypt'99, LNCS 1592, 223-238.
20. S.C. Pohlig and M.E. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance. In IEEE Trans. on IT, 24, 106-110, 1978.
21. J. Proos. Joint Sparse Forms and Generating Zero Columns when Combing. University of Waterloo, Technical Report CORR 2003-23.
22. K. Rubin and A. Silverberg. Supersingular Abelian Varieties in Cryptology. Crypto'02, LNCS 2442, 336-353.
23. K. Rubin and A. Silverberg. Torus-Based Cryptography. Crypto'03, LNCS 2729, 349-365.
24. K. Rubin and A. Silverberg. Algebraic Tori in Cryptography. In High Primes and Misdemeanours: Lectures in Honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communications Series 41, American Mathematical Society, 317-326, 2004.
25. K. Rubin and A. Silverberg. Using Primitive Subgroups to Do More with Fewer Bits. ANTS-VI, LNCS 3076, 18-41, 2004.
26. B. Schoenmakers and P. Tuyls, Practical Two-Party Computation Based on the Conditional Gate, Asiacrypt'04, LNCS 3329, 119-136.
27. J.A. Solinas. Low-Weight Binary Representations for Pairs of Integers. University of Waterloo, Technical Report CORR 2001-41.
28. M. Stam and A.K. Lenstra. Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. CHES'02, LNCS 2523, 318-332.
29. M. Stam and A.K. Lenstra. Speeding Up XTR. Asiacrypt'01, LNCS 2248, 125-143.
30. V.E. Voskresenskiǐ. Algebraic Groups and Their Birational Invariants. Translations of Mathematical Monographs 179, American Mathematical Society, 1998.
31. A. Yamamura and T. Saito. Private Information Retrieval Based on the Subgroup Membership Problem. ACISP'01, LNCS 2119, 206-220.