Asymptotically optimal communication for torus-based cryptography

Asymptotically optimal communication for torus-based cryptography (2004)

by Marten Van Dijk , David Woodruff

Venue:	In Advances in Cryptology (CRYPTO 2004), Springer LNCS 3152
Citations:	9 - 1 self

Datum	Value	Source
TITLE	Asymptotically optimal communication for torus-based cryptography	INFERENCE
AUTHOR NAME	Marten Van Dijk	SVM HeaderParse 0.2
AUTHOR AFFIL	1 MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA	SVM HeaderParse 0.2
AUTHOR NAME	David Woodruff	SVM HeaderParse 0.2
AUTHOR AFFIL	1 MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA	SVM HeaderParse 0.2
ABSTRACT	Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the optimal communication rate, partially answering the conjecture in [4]. For n the product of distinct primes, we construct efficient ElGamal signature and encryption schemes in a subgroup of F ∗ qn in which the number of bits exchanged is only a φ(n)/n fraction of that required in traditional schemes, while the security offered remains the same. We also present a Diffie-Hellman key exchange protocol averaging only φ(n) log2 q bits of communication per key. For the cryptographically important cases of n = 30 and n = 210, we transmit a 4/5 and a 24/35 fraction, respectively, of the number of bits required in XTR [14] and recent CEILIDH [24] cryptosystems. 1	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	In Advances in Cryptology (CRYPTO 2004), Springer LNCS 3152	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	157--178	INFERENCE
CITATIONS	31 found	ParsCit 1.0