Results 21 to 30 of about 92,548 (300)
A New Identification Scheme based on Syndrome Decoding Problem with Provable Security against Quantum Adversaries [PDF]
Journal of Universal Computer Science, 2019 Recently, in order to guarantee security against quantum adversaries, several identification (ID) schemes based on computational problems which are supposed to be hard even for quantum computers have been proposed. However, their security are only proven
Bagus Santoso, Chunhua Su
doaj +3 more sources
Mathematics, 2023 In this paper, by introducing an isomorphism from the Mihailova subgroup of F2×F2 to the Mihailova subgroups of a braid group, we give an explicit presentation of Mihailova subgroups of a braid group.
Hanling Lin, Xiaofeng Wang, Min Li
doaj +1 more source
SPEEDY Quantum Circuit for Grover’s Algorithm
Applied Sciences, 2022 In this paper, we propose a quantum circuit for the SPEEDY block cipher for the first time and estimate its security strength based on the post-quantum security strength presented by NIST.
Gyeongju Song +7 more
doaj +1 more source
Lattice-Based Cryptography in the Quantum Era: A Survey
Interfases, 2023 The advent of quantum computing reveals current classical cryptography’s incapacity to withstand attacks within the new paradigm. Quantum algorithms break such encryption with impressive ease, with Shor and Grover algorithms being the main perpetrators ...
Mauricio Cisneros, Javier Olazabal
doaj +1 more source
Quantum violations in the Instrumental scenario and their relations to the Bell scenario [PDF]
, 2019 The causal structure of any experiment implies restrictions on the observable correlations between measurement outcomes, which are different for experiments exploiting classical, quantum, or post-quantum resources. In the study of Bell nonlocality, these
Brask, Jonatan Bohr +5 more
core +2 more sources
Random Oracles in a Quantum World [PDF]
, 2011 The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett +25 more
core +3 more sources
IEEE Access, 2021 Polynomial-time attacks designed to run on quantum computers and capable of breaking RSA and AES are already known. It is imperative to develop quantum-resistant algorithms before quantum computers become available.
Ricardo Neftali Pontaza Rodas +3 more
doaj +1 more source
Lattice-Based proof of a shuffle [PDF]
, 2019 In this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes. Shuffles are commonly used to construct mixing networks (mix-nets), a key element to ensure anonymity in many applications such as electronic voting ...
Costa, Nuria +2 more
core +1 more source
Evaluation of Post-Quantum Distributed Ledger Cryptography
The Journal of The British Blockchain Association, 2019 This paper evaluates the current cybersecurity vulnerability of the prolific use of Elliptical Curve Digital Signature Algorithm (ECDSA) cryptography in use by the Bitcoin Core, Ethereum, Bitcoin Cash, and enterprise blockchains such as ...
Robert E. Campbell Sr.
doaj +1 more source
Post-Quantum Blockchain-Based Secure Service Orchestration in Multi-Cloud Networks
IEEE Access, 2022 Existing network service provisioning and lifecycle management (LCM) workflows rely on heterogeneous devices from multiple vendors and collaboration between multiple network actors, which can lead to numerous trust management and interoperability issues.
Engin Zeydan +2 more
doaj +1 more source