Abstract
The properties of Schnorr-Adleman lattice were determined. Lattice reduction algorithms was used to estimate the length of a shortest vector and the distance of a vector from a lattice. It was proved that factoring problem was random polynomial time reducible to shortest vector problem (SVP). The Schnorr-Adleman lattice is also used to construct sphere packing with exponential lattice points.
| Original language | English |
|---|---|
| Pages | 946-949 |
| Number of pages | 4 |
| Publication status | Published - 2003 |
| Externally published | Yes |
| Event | Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings - Chengdu, China Duration: 27 Aug 2003 → 29 Aug 2003 |
Conference
| Conference | Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings |
|---|---|
| Country/Territory | China |
| City | Chengdu |
| Period | 27/08/03 → 29/08/03 |
Keywords
- Lattice
- Norm
- The closest vector