9 research outputs found
Quantum Algorithms for Attacking Hardness Assumptions in Classical and Post‐Quantum Cryptography
In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post-quantum secure cryptosystems. The authors provide details on the cost of the quantum algorithms presented in this survey. The authors furthermore discuss ongoing research directions that can impact quantum cryptanalysis in the future
Mitigating Multi-Target Attacks in Hash-based Signatures
This work introduces XMSS-T, a new hash-based signature scheme with tight security. Previous hash-based signature schemes are facing a loss of security, linear in performance parameters like the total tree height. Our new scheme can use hash functions with a smaller output length at the same security level, immediately leading to a smaller signature size. XMSS-T is stateful, however, the same techniques also apply directly to the recent stateless hash-based signature scheme SPHINCS (Eurocrypt 2015), and the signature size is improved as a result.
Being a little more specific and technical, the tight security stems from new multi-target notions of hash-function properties which we define and analyze. We give precise complexity for breaking these security properties under both classical and quantum generic attacks, thus establishing a reliable estimate for the quantum security of XMSS-T. Especially, we prove quantum upper and lower bounds for the query complexity tailored for cryptographic applications, whereas standard techniques in quantum query complexity have limitations such as they usually only consider worst-case complexity. Our proof techniques may be useful elsewhere.
We also implement XMSS-T and compare its performance to that of the most recent stateful hash-based signature scheme XMSS (PQCrypto 2011)
Signed tropicalization of polar cones
We study the tropical analogue of the notion of polar of a cone, working over
the semiring of tropical numbers with signs. We characterize the cones which
arise as polars of sets of tropically nonnegative vectors by an invariance
property with respect to a tropical analogue of Fourier-Motzkin elimination. We
also relate tropical polars with images by the nonarchimedean valuation of
classical polars over real closed nonarchimedean fields and show, in
particular, that for semi-algebraic sets over such fields, the operation of
taking the polar commutes with the operation of signed valuation (keeping track
both of the nonarchimedean valuation and sign). We apply these results to
characterize images by the signed valuation of classical cones of matrices,
including the cones of positive semidefinite matrices, completely positive
matrices, completely positive semidefinite matrices, and their polars,
including the cone of co-positive matrices, showing that hierarchies of
classical cones collapse under tropicalization. We finally discuss an
application of these ideas to optimization with signed tropical numbers.Comment: 24 pages, 1 figure. Changes with respect to Version 2: we improved
Introduction and added Examples 3.24 and 3.25 illustrating that "bend
addition" can be considered as a tropical analogue of the Fourier-Motzkin
eliminatio
Understanding Quantum Technologies 2022
Understanding Quantum Technologies 2022 is a creative-commons ebook that
provides a unique 360 degrees overview of quantum technologies from science and
technology to geopolitical and societal issues. It covers quantum physics
history, quantum physics 101, gate-based quantum computing, quantum computing
engineering (including quantum error corrections and quantum computing
energetics), quantum computing hardware (all qubit types, including quantum
annealing and quantum simulation paradigms, history, science, research,
implementation and vendors), quantum enabling technologies (cryogenics, control
electronics, photonics, components fabs, raw materials), quantum computing
algorithms, software development tools and use cases, unconventional computing
(potential alternatives to quantum and classical computing), quantum
telecommunications and cryptography, quantum sensing, quantum technologies
around the world, quantum technologies societal impact and even quantum fake
sciences. The main audience are computer science engineers, developers and IT
specialists as well as quantum scientists and students who want to acquire a
global view of how quantum technologies work, and particularly quantum
computing. This version is an extensive update to the 2021 edition published in
October 2021.Comment: 1132 pages, 920 figures, Letter forma