Sciweavers

77 search results - page 7 / 16
» Public-Key Cryptosystems from Lattice Reduction Problems
Sort
View
PKC
2005
Springer
67views Cryptology» more  PKC 2005»
14 years 29 days ago
Symmetric Subgroup Membership Problems
Abstract. We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup...
Kristian Gjøsteen
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 11 months ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 1 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes