Attacks on Integer-RLWE
dc.contributor.author | Budroni, Alessandro | |
dc.contributor.author | Chetioui, Benjamin | |
dc.contributor.author | Franch, Ermes | |
dc.date.accessioned | 2021-05-26T13:28:13Z | |
dc.date.available | 2021-05-26T13:28:13Z | |
dc.date.created | 2021-01-18T13:09:35Z | |
dc.date.issued | 2020 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://hdl.handle.net/11250/2756488 | |
dc.description.abstract | In 2019, Gu Chunsheng introduced Integer-RLWE, a variant of RLWE devoid of some of its efficiency flaws. Most notably, he proposes a setting where n can be an arbitrary positive integer, contrarily to the typical construction n=2k . In this paper, we analyze the new problem and implement the classical meet-in-the-middle and lattice-based attacks. We then use the peculiarity of the construction of n to build an improved lattice-based attack in cases where n is composite with an odd divisor. For example, for parameters n=2000 and q=233 , we reduce the estimated complexity of the attack from 2288 to 2164 . We also present reproducible experiments confirming our theoretical results. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.title | Attacks on Integer-RLWE | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2020 Springer | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | https://doi.org/10.1007/978-3-030-61078-4_30 | |
dc.identifier.cristin | 1873226 | |
dc.source.journal | Lecture Notes in Computer Science (LNCS) | en_US |
dc.source.pagenumber | 528-542 | en_US |
dc.identifier.citation | Lecture Notes in Computer Science (LNCS). 2020, 12282, 528-542 | en_US |
dc.source.volume | 12282 | en_US |
Tilhørende fil(er)
Denne innførselen finnes i følgende samling(er)
-
Department of Informatics [917]
-
Registrations from Cristin [9489]