Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Joop van de Pol"'
Publikováno v:
Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229718
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c3a9eedc44b91e9a01166cd4667a0e6
https://doi.org/10.1007/978-3-031-22972-5_18
https://doi.org/10.1007/978-3-031-22972-5_18
Publikováno v:
IET Information Security. 10:348-357
We describe a method to bootstrap a packed BGV ciphertext which does not depend (as much) on any special properties of the plaintext and ciphertext moduli. Prior “efficient” methods such as that of Gentry et al. (PKC 2012) required a ciphertext m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a05cda4b663b26a9b384711dec358a98
https://doi.org/10.1049/iet-ifs.2015.0505
https://doi.org/10.1049/iet-ifs.2015.0505
Publikováno v:
Designs, Codes, and Cryptography
Designs, Codes and Cryptography, 77(2-3), 375-400. Springer
Laarhoven, T, Mosca, M & Van De Pol, J 2015, ' Finding shortest lattice vectors faster using quantum search ', Designs, Codes and Cryptography, vol. 77, no. 2, pp. 375-400 . https://doi.org/10.1007/s10623-015-0067-5
Designs, Codes and Cryptography, 77(2-3), 375-400. Springer
Laarhoven, T, Mosca, M & Van De Pol, J 2015, ' Finding shortest lattice vectors faster using quantum search ', Designs, Codes and Cryptography, vol. 77, no. 2, pp. 375-400 . https://doi.org/10.1007/s10623-015-0067-5
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can provably f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d444a50e9eaac44e585c1c86fe1f51f4
https://doi.org/10.1007/s10623-015-0067-5
https://doi.org/10.1007/s10623-015-0067-5
Publikováno v:
International Journal of Applied Cryptography
The security of many lattice-based cryptographic schemes relies on the hardness of finding short vectors in integral lattices. We propose a new variant of the parallel Gauss sieve algorithm to compute such short vectors. It combines favourable proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36a041f07812002200e8465e42d9943f
Publikováno v:
Post-Quantum Cryptography ISBN: 9783642386152
Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings), 83-101
STARTPAGE=83;ENDPAGE=101;TITLE=Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings)
Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings), 83-101
STARTPAGE=83;ENDPAGE=101;TITLE=Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings)
By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem. With
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a885a7e2d9dba4045fb66de8d0a15d27
https://doi.org/10.1007/978-3-642-38616-9_6
https://doi.org/10.1007/978-3-642-38616-9_6
Publikováno v:
ACSAC
Interference between processes executing on shared hardware can be used to mount performance-degradation attacks. However, in most cases, such attacks offer little benefit for the adversary. In this paper, we demonstrate that software-based performan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8a0bdc3771db255c918794e54b583e3
https://doi.org/10.1145/2991079.2991084
https://doi.org/10.1145/2991079.2991084
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662464465
Public Key Cryptography
Public Key Cryptography
We describe a method to bootstrap a packed BGV ciphertext which does not depend (as much) on any special properties of the plaintext and ciphertext moduli. Prior “efficient” methods such as that of Gentry et al. (PKC 2012) required a ciphertext m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94bfa830cde14a4e9622edb5327e2215
https://doi.org/10.1007/978-3-662-46447-2_30
https://doi.org/10.1007/978-3-662-46447-2_30
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319167145
CT-RSA
CT-RSA
We extend the Flush+Reload side-channel attack of Benger et al. to extract a significantly larger number of bits of information per observed signature when using OpenSSL. This means that by observing only 25 signatures, we can recover secret keys of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36ff22b292f5b1649f2a4aafc8efc14c
https://doi.org/10.1007/978-3-319-16715-2_1
https://doi.org/10.1007/978-3-319-16715-2_1
Publikováno v:
Cryptographic Hardware and Embedded Systems – CHES 2014.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=erc_________::87111a7c99abbbeefe75969356da13b8
Publikováno v:
Advanced Information Systems Engineering ISBN: 9783642387081
CHES
CHES
We apply the Flush+Reload side-channel attack based on cache hits/misses to extract a small amount of data from OpenSSL ECDSA signature requests. We then apply a "standard" lattice technique to extract the private key, but unlike previous attacks we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e34877fcb8decaae7f75ae4c387d903e
https://doi.org/10.1007/978-3-662-44709-3_5
https://doi.org/10.1007/978-3-662-44709-3_5