摘要
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.
| 原文 | English |
|---|---|
| 頁面 | 946-949 |
| 頁數 | 4 |
| 出版狀態 | Published - 2003 |
| 對外發佈 | 是 |
| 事件 | Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings - Chengdu, China 持續時間: 27 8月 2003 → 29 8月 2003 |
Conference
| Conference | Parallel and Distributed Computing, Applications and Technologies, PDCAT 2003 Proceedings |
|---|---|
| 國家/地區 | China |
| 城市 | Chengdu |
| 期間 | 27/08/03 → 29/08/03 |