Sciweavers

EUROCRYPT
2011
Springer
12 years 8 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
ACISP
2011
Springer
12 years 8 months ago
A Generic Variant of NIST's KAS2 Key Agreement Protocol
We propose a generic three-pass key agreement protocol that is based on a certain kind of trapdoor one-way function family. When specialized to the RSA setting, the generic protoco...
Sanjit Chatterjee, Alfred Menezes, Berkant Ustaogl...
DAM
2008
92views more  DAM 2008»
13 years 4 months ago
Applications to cryptography of twisting commutative algebraic groups
We give an overview on twisting commutative algebraic groups and applications to discrete log based cryptography. We explain how discrete log based cryptography over extension fie...
Alice Silverberg
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...