Sciweavers

30 search results - page 4 / 6
» On the Extremality of an 80-Dimensional Lattice
Sort
View
JLP
2010
110views more  JLP 2010»
13 years 5 months ago
Similarity, topology, and uniformity
We generalize various notions of generalized metrics even further to one general concept comprising them all. For convenience, we turn around the ordering in the target domain of ...
Reinhold Heckmann
EUROCRYPT
2011
Springer
12 years 11 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux
CLA
2004
13 years 8 months ago
A Semi-automatic Method to Ontology Design by Using FCA
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
Hele-Mai Haav