TY - GEN
T1 - Practical cryptography in high dimensional tori
AU - Van Dijk, M.
AU - Granger, R.
AU - Page, D.
AU - Rubin, K.
AU - Silverberg, A.
AU - Stam, M.
AU - Woodruff, D.
PY - 2005
Y1 - 2005
N2 - 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. © International Association for Cryptologic Research 2005.
AB - 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. © International Association for Cryptologic Research 2005.
UR - http://www.scopus.com/inward/record.url?scp=24944495534&partnerID=8YFLogxK
U2 - 10.1007/11426639_14
DO - 10.1007/11426639_14
M3 - Conference contribution
T3 - Lecture Notes in Computer Science
SP - 234
EP - 250
BT - Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings
PB - Springer Verlag
T2 - 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology - EUROCRYPT 2005
Y2 - 22 May 2005 through 26 May 2005
ER -
