Name
Abstract | ||
|---|---|---|
At Crypto 2004, van Dijk and Woodruff introduced a new way of using the algebraic tori Tn in cryptography, and obtained an asymptotically optimal n/φ(n) savings in bandwidth and storage for a number of cryptographic applications. However, the computational requirements of compression and decompression in their scheme were impractical, and it was left open to reduce them to a practical level. We give a new method that compresses orders of magnitude faster than the original, while also speeding up the decompression and improving on the compression factor (by a constant term). Further, we give the first efficient implementation that uses T30, compare its performance to XTR, CEILIDH, and ECC, and present new applications. Our methods achieve better compression than XTR and CEILIDH for the compression of as few as two group elements. This allows us to apply our results to ElGamal encryption with a small message domain to obtain ciphertexts that are 10% smaller than in previous schemes. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11426639_14 | EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques |
Keywords | DocType | Volume |
computational requirement,elgamal encryption,high dimensional torus,discrete-log based cryptography,compression factor,better compression,practical cryptography,compresses order,algebraic tori tn,present new application,new method,constant term,asymptotically optimal n,torus-based cryptography | Conference | 3494 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-25910-4 | 27 |
PageRank | References | Authors |
1.27 | 30 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marten Van Dijk | 1 | 2875 | 242.07 |
| Robert Granger | 2 | 183 | 12.81 |
| Dan Page | 3 | 201 | 14.62 |
| Karl Rubin | 4 | 182 | 20.30 |
| alice silverberg | 5 | 30 | 2.82 |
| Martijn Stam | 6 | 1659 | 67.36 |
| David P. Woodruff | 7 | 2156 | 142.38 |