Sciweavers

185 search results - page 16 / 37
» A Lattice-Based Public-Key Cryptosystem
Sort
View
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
14 years 3 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
CORR
2006
Springer
111views Education» more  CORR 2006»
13 years 10 months ago
Length-based cryptanalysis: The case of Thompson's Group
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 4 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
ASIACRYPT
2000
Springer
14 years 2 months ago
Strengthening McEliece Cryptosystem
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present...
Pierre Loidreau
INDOCRYPT
2005
Springer
14 years 3 months ago
MaTRU: A New NTRU-Based Cryptosystem
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
Michael Coglianese, Bok-Min Goi