Adiabatic quantum computation
Adiabatic quantum computing (AQC) started as an approach to solving optimization
problems and has evolved into an important universal alternative to the standard circuit …
problems and has evolved into an important universal alternative to the standard circuit …
Quantum Walk Computing: Theory, Implementation, and Application
X Qiang, S Ma, H Song - Intelligent Computing, 2024 - spj.science.org
The classical random walk formalism plays an important role in a wide range of applications.
Its quantum counterpart, the quantum walk, is proposed as an important theoretical model …
Its quantum counterpart, the quantum walk, is proposed as an important theoretical model …
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in
complexity theory and cryptography. The security of almost all coding and LPN/LWE-based …
complexity theory and cryptography. The security of almost all coding and LPN/LWE-based …
On computing nearest neighbors with applications to decoding of binary linear codes
A May, I Ozerov - Annual International Conference on the Theory and …, 2015 - Springer
We propose a new decoding algorithm for random binary linear codes. The so-called
information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 …
information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 …
LadderLeak: Breaking ECDSA with less than one bit of nonce leakage
DF Aranha, FR Novaes, A Takahashi… - Proceedings of the …, 2020 - dl.acm.org
Although it is one of the most popular signature schemes today, ECDSA presents a number
of implementation pitfalls, in particular due to the very sensitive nature of the random value …
of implementation pitfalls, in particular due to the very sensitive nature of the random value …
Equihash: Asymmetric proof-of-work based on the generalized birthday problem
A Biryukov, D Khovratovich - Ledger, 2017 - ledgerjournal.org
Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice
protection tools, but the requirement for fast verification so far has made it an easy prey for …
protection tools, but the requirement for fast verification so far has made it an easy prey for …
Quantum security analysis of CSIDH
X Bonnetain, A Schrottenloher - … on the Theory and Applications of …, 2020 - Springer
CSIDH is a recent proposal for post-quantum non-interactive key-exchange, based on
supersingular elliptic curve isogenies. It is similar in design to a previous scheme by …
supersingular elliptic curve isogenies. It is similar in design to a previous scheme by …
On the complexity of the BKW algorithm on LWE
MR Albrecht, C Cid, JC Faugere, R Fitzpatrick… - Designs, Codes and …, 2015 - Springer
This work presents a study of the complexity of the Blum–Kalai–Wasserman (BKW)
algorithm when applied to the Learning with Errors (LWE) problem, by providing refined …
algorithm when applied to the Learning with Errors (LWE) problem, by providing refined …
Lattice decoding attacks on binary LWE
S Bai, SD Galbraith - Information Security and Privacy: 19th Australasian …, 2014 - Springer
We consider the binary-LWE problem, which is the learning with errors problem when the
entries of the secret vector are chosen from {0, 1} or {− 1, 0, 1}. Our main result is an …
entries of the secret vector are chosen from {0, 1} or {− 1, 0, 1}. Our main result is an …
SETH-based lower bounds for subset sum and bicriteria path
A Abboud, K Bringmann, D Hermelin… - ACM Transactions on …, 2022 - dl.acm.org
Subset Sumand k-SAT are two of the most extensively studied problems in computer
science, and conjectures about their hardness are among the cornerstones of fine-grained …
science, and conjectures about their hardness are among the cornerstones of fine-grained …