Sciweavers

256 search results - page 26 / 52
» Recursive Lattice Reduction
Sort
View
AISS
2010
147views more  AISS 2010»
13 years 5 months ago
Correlating Lattice Constant of Cubic Perovskites to Atomic Parameters Using Support Vector Regression
Recently, due to problems arising from lattice mismatch in thin film growth in semiconductor manufacturing industry, researchers have shown great interest in modeling the physioch...
Abdul Majid, Yeon Soo Lee
ICASSP
2011
IEEE
12 years 11 months ago
A Lagrangian dual relaxation approach to ML MIMO detection: Reinterpreting regularized lattice decoding
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
Jiaxian Pan, Wing-Kin Ma
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 4 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
IACR
2011
141views more  IACR 2011»
12 years 7 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 6 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger