Citation
Mandangan, Arif and Kamarulhaili, Hailiza and Asbullah, Muhammad Asyraf
(2019)
On the smallest-basis problem underlying the GGH lattice-based cryptosystem.
Malaysian Journal of Mathematical Sciences, 13 (spec. Aug.).
pp. 1-11.
ISSN 1823-8343; ESSN: 2289-750X
Abstract
The security of the Goldreich-Goldwasser-Halevi (GGH) cryptosystem is relying on the Smallest-Basis Problem (SBP) and the Closest-Vector Problem (CVP) instances. Previously, these instances were just implicitly mentioned and discussed without any proper definition. In this paper, we explicitly defined the underlying SBP instance that arose from the GGH cryptosystem. From that, we showed how the solution to these problems could be obtained and how the obtained solutions could lead to the security breach in the GGH cryptosystem. Finally, we proposed some possible strategies for strengthening the security of the GGH cryptosystem.
Download File
Official URL or Download Paper: http://einspem.upm.edu.my/journal/fullpaper/vol13s...
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Institute for Mathematical Research Centre of Foundation Studies for Agricultural Science |
| Publisher: | Institute for Mathematical Research, Universiti Putra Malaysia |
| Notes: | Special Issue: The 6th International Cryptology and Information Security Conference (CRYPTOLOGY2018) |
| Keywords: | GGH cryptosystem; Smallest-basis problem; Closest-vector problem; Shortest-vector problem |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 04 Feb 2020 04:08 |
| Last Modified: | 04 Feb 2020 04:08 |
| URI: | http://psasir.upm.edu.my/id/eprint/76371 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |