Zobrazeno 1 - 10
of 1 482
pro vyhledávání: '"Lattice problem"'
Autor:
Palash Sarkar, Subhadip Singha
Publikováno v:
Advances in Mathematics of Communications. 17:484-499
Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a classical reduction from the gap shortest vector problem to LWE was obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e166463a03c09d59da466c4c17ad7813
https://doi.org/10.3934/amc.2021004
https://doi.org/10.3934/amc.2021004
Autor:
Friedrich Eisenbrand, Moritz Venzin
Publikováno v:
Journal of Computer and System Sciences. 124:129-139
We show that a constant factor approximation of the shortest and closest lattice vector problem in any l p -norm can be computed in time 2 ( 0.802 + e ) n . This matches the currently fastest constant factor approximation algorithm for the shortest v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a8db5fae523ca8b380fff5e24762ae8
https://doi.org/10.1016/j.jcss.2021.09.006
https://doi.org/10.1016/j.jcss.2021.09.006
Autor:
Masaya Yasuda, Satoshi Nakamura
Publikováno v:
Discrete Applied Mathematics. 304:220-229
Lattice problems are algorithmic problems for lattices, whose hardness assures the security of lattice-based cryptography. Given a basis of a lattice, the goal of lattice basis reduction is to seek a new basis of the same lattice whose basis vectors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::160e086b6efb79b9403e6ac45252ca32
https://doi.org/10.1016/j.dam.2021.07.035
https://doi.org/10.1016/j.dam.2021.07.035
Publikováno v:
Designs, Codes and Cryptography. 90:239-263
The Ring Learning-With-Errors (LWE) problem, whose security is based on hard ideal lattice problems, has proven to be a promising primitive with diverse applications in cryptography. There are however recent discoveries of faster algorithms for the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1370956f80cdf4f1cbb086054f63a291
https://doi.org/10.1007/s10623-021-00973-6
https://doi.org/10.1007/s10623-021-00973-6
Publikováno v:
Journal of Number Theory. 227:308-329
The Shortest Vector Problem and the computation of the tame kernel in algebraic K-theory are two different but very important problems, and up to now no one has found any manipulated relations between them. In this paper, we are successful for the fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b8450e565ecbe2f49954c327f4e87aa
https://doi.org/10.1016/j.jnt.2021.03.022
https://doi.org/10.1016/j.jnt.2021.03.022
Autor:
Daniel S. Steffen, Anselmo Chaves Neto
Publikováno v:
IEEE Latin America Transactions. 19:1217-1224
The present work aims to use Self-Organizing Maps (SOM) to group ranking results obtained by factor analysis. In this paper we propose the application of Factor Analysis at a stage prior to the application of the SOM, in order to use the factor score
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::544afe2b2c3a1d420a39318da24867e6
https://doi.org/10.1109/tla.2021.9461851
https://doi.org/10.1109/tla.2021.9461851
Publikováno v:
Journal of Systems Science and Complexity. 35:1191-1200
Lattices in Euclidean spaces are important research objects in geometric number theory, and they have important applications in many areas, such as cryptology. The shortest vector problem (SVP) and the closest vector problem (CVP) are two famous comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62eeb1bd67bf5f033ac8748b296541dc
https://doi.org/10.1007/s11424-021-0074-8
https://doi.org/10.1007/s11424-021-0074-8
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 68:1403-1407
Ring learning with errors (RLWE) is an efficient lattice-based cryptographic scheme that has worst-case reduction to lattice problem, conjectured to be quantum-hard. Ring-BinLWE is an optimized variant of RLWE problem using binary error distribution,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afc505ec85f83326f60723ce7486629f
https://doi.org/10.1109/tcsii.2020.3025857
https://doi.org/10.1109/tcsii.2020.3025857
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :714-722
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbc7ddacda4dd06f0343b3b72f19a8ca
https://doi.org/10.1587/transfun.2020eap1064
https://doi.org/10.1587/transfun.2020eap1064
Publikováno v:
Chinese Journal of Electronics. 30:238-248
Digital signature is one of the most important cryptography primitives. Recently, more and more works have been done to construct signatures over lattice problems to keep them secure in the quantum age. Among them, a ring-based signature scheme named
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::640c7aec8d56514c232bf8af09d395f4
https://doi.org/10.1049/cje.2021.01.006
https://doi.org/10.1049/cje.2021.01.006