Post-quantum key exchange for the TLS protocol from the ring learning with errors problem
Lattice-based cryptographic primitives are believed to offer resilience against attacks by
quantum computers. We demonstrate the practicality of post-quantum key exchange by …
quantum computers. We demonstrate the practicality of post-quantum key exchange by …
Security guidelines for implementing homomorphic encryption
JP Bossuat, R Cammarota, I Chillotti… - Cryptology ePrint …, 2024 - eprint.iacr.org
Abstract Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows
performing arbitrary operations on encrypted data. Since the conception of the idea in …
performing arbitrary operations on encrypted data. Since the conception of the idea in …
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
T Laarhoven, B de Weger - … on Cryptology and Information Security in …, 2015 - Springer
Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to
significantly speed up lattice sieving, leading to a heuristic time complexity for solving the …
significantly speed up lattice sieving, leading to a heuristic time complexity for solving the …
Round5: Kem and pke based on glwr
S Bhattacharya, O Garcia-Morchon… - Cryptology ePrint …, 2018 - eprint.iacr.org
Standardization bodies such as NIST and ETSI are currently seeking quantum resistant
alternatives to vulnerable RSA and elliptic curve-based public-key algorithms. In this context …
alternatives to vulnerable RSA and elliptic curve-based public-key algorithms. In this context …
[PDF][PDF] Draft Friday 25th January, 2019
H Baan, S Bhattacharya, S Fluhrer, O Garcia-Morchon… - academia.edu
Standardization bodies such as NIST and ETSI are currently seeking quantum resistant
alternatives to vulnerable RSA and elliptic curve-based public-key algorithms. In this context …
alternatives to vulnerable RSA and elliptic curve-based public-key algorithms. In this context …
Експериментальне дослідження постквантумних методів шифрування та криптографії
ДО Хірний - 2020 - dspace.library.khai.edu
У ході виконання дипломної роботи було досліджено проблему захисту від квантових
комп'ютерів. Були розглянуті алгоритми захисту такі як: NTRU-KEM, NTRU-CCA. Також …
комп'ютерів. Були розглянуті алгоритми захисту такі як: NTRU-KEM, NTRU-CCA. Також …
[PDF][PDF] Дослідження постквантумних алгоритмів. Шифрування
МВ Мірошніков - 2020 - openarchive.nure.ua
36 ДОДАТОК А (довідковий) Вихідний код програми Page 1 36 ДОДАТОК А (довідковий)
Вихідний код програми #include <stdlib.h> #include <stdint.h> #include "crypto_stream_salsa20.h" …
Вихідний код програми #include <stdlib.h> #include <stdint.h> #include "crypto_stream_salsa20.h" …
[引用][C] Round5: Compact and fast post-quantum public-key encryption.
S Bhattacharya, O Garcia-Morchon… - IACR Cryptology …, 2018 - research.tue.nl
Round5: Compact and Fast Post-Quantum Public-Key Encryption. — Eindhoven University of
Technology research portal Skip to main navigation Skip to search Skip to main content …
Technology research portal Skip to main navigation Skip to search Skip to main content …