A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A practicable timing attack against HQC and its countermeasure
2019
Advances in Mathematics of Communications
Preserved Fulltext
In this paper, we present a practicable chosen ciphertext timing attack retrieving the secret key of HQC. ...
For the 128-bit security parameters of HQC, the attack runs in less than a minute on a desktop computer using roughly 6000 decoding requests and has a success probability of approximately 93 percent. ...
Introduction HQC [1, 3] is a code-based IND-CCA2-secure public key encryption scheme, whose security is based on the hardness of the quasi-cyclic syndrome decoding problem. ...
doi:10.3934/amc.2020126
fatcat:jgcmza47pvb2nfocypifi6uzsq
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
2021
Transactions on Cryptographic Hardware and Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The proposed attack exploits side-channel leakage during execution of a pseudorandom function (PRF) or pseudorandom number generator (PRG) in the re-encryption of KEM decapsulation as a plaintext-checking ...
This paper also presents a side-channel distinguisher design based on deep learning (DL) for mounting the proposed attack on practical implementation without the use of a profiling device. ...
Code-based KEMs
HQC Roughly speaking, HQC has a structure similar to those of the lattice-based KEM schemes Kyber, Saber, FrodoKEM, and NTRU LPRime, even though HQC is based on the code problem. ...
doi:10.46586/tches.v2022.i1.296-322
fatcat:harfhr4cjbawfctnupxar6upmi
Efficient Encryption from Random Quasi-Cyclic Codes
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We depart somewhat from Aleknovich's approach and propose an encryption scheme based on the difficulty of decoding random quasi-cyclic codes. ...
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. ...
A NEW ENCRYPTION SCHEME
A. Encryption and Security
Encryption Scheme. ...
arXiv:1612.05572v1
fatcat:up7iubangna3db2gd77tfi3ywe
Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Grover's search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. ...
The best classical algorithms available take exponential time. Shor's factoring algorithm can solve the problems in polynomial time. ...
HQC (Alternative) Hamming Quasi Cyclic is a code-based public-key encryption scheme. It is based on the hardness of decisional quasi-cyclic syndrome decoding with parity problem. ...
arXiv:2202.02826v1
fatcat:ghq4lqiu4rf5vpuv6gbk7ws4jm
Processes and methods for selecting system-wide parameters and analysis of resistance against third-party channel attacks for the key encapsulation mechanism DSTU 8961:2019
2021
Radiotechnics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The dependence of encryption and decryption time on the level of stability is analyzed. ...
The most vulnerable are public-key schemes based on factorization, discrete logarithms and elliptic curve cryptography. ...
For KEM algorithms, the key generation time is considered to be on a par with the forward and reverse conversion times because a large number of applications use a new key pair for each session to provide ...
doi:10.30837/rt.2021.2.205.06
fatcat:ymxitnbjqjgoll4b4fw3to53aq
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, extensive comparisons are provided on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains. ...
However, the fast progress of quantum computing has opened the possibility of performing attacks based on Grover's and Shor's algorithms in the near future. ...
of HQC). ...
doi:10.1109/access.2020.2968985
fatcat:7wsxhxrfojdmzcxtjtrk6cmcci
A Survey on Code-Based Cryptography
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2201.07119v2 fatcat:mxnzbqmztvfkpdh62ahokp6g4yOther Versions
In preparation for the quantum era the National Institute of Standards and Technology (NIST) has initiated a standardization process for public-key encryption (PKE) schemes, key-encapsulation mechanisms ...
With this chapter we aim at providing a survey on code-based cryptography, focusing on PKEs and signature schemes. ...
Acknowledgement The first author is supported by the Swiss National Science Foundation grant number 195290. ...
arXiv:2201.07119v3
fatcat:oo53emg22jdxtmsevemlit7hlm
Quantum Indistinguishability for Public Key Encryption
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show a distinguishing attack against code-based schemes and against LWE-based schemes with certain parameters. ...
In this work we study the quantum security of public key encryption schemes (PKE). ...
The authors also thank Cecilia Boschini and Marc Fischlin for helpful discussions regarding the correctness of public key encryption schemes and Andreas Hülsing for general discussions on the content of ...
arXiv:2003.00578v5
fatcat:jeeomm7oy5bo7asdlnxqebaurq
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
2021
Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The emergence of quantum computing poses a major threat to the modern cryptosystems based on modular arithmetic, whereby even the computationally hard problems which constitute the strength of the modular ...
Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems, based on modular arithmetic to the contemporary cryptosystems based on quantum computing ...
Acknowledgments: This research work has been carried out under the leadership of the Institute for Technological Research SystemX, and therefore granted within the scope of the program "Recherche Exploratoire ...
doi:10.3390/cryptography5040038
fatcat:wkb43zunwjagbnljc6brfou4ty
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A practical case study on the Internet of Vehicles (IoV) is presented to demonstrate how PETs can be applied in reality. ...
capable of withstanding quantum computing attacks. ...
A well-known attack on these systems is the FATS attack, short for Fingerprint and Timing based Snooping (FATS), which was first presented in [7] . ...
doi:10.1109/access.2021.3062201
fatcat:kqcwwqjfjnds7bzlrid7r6gjlu
Self Organized Replica Overlay Scheme for P2P Networks
2012
International Journal of Computer Network and Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This scheme is highly fault tolerant (tolerate up to 1 n faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network ...
The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums ...
The Multi Level Voting protocol is based on the concepts of the Hierarchical Quorum Consensus (HQC) strategy. HQC [23, 35, 36] is a generalization of the Majority Scheme. ...
doi:10.5815/ijcnis.2012.10.02
fatcat:ghjqvqiddrcezdy4wsr27ybpdm
Energy Efficiency Analysis of Post-Quantum Cryptographic Algorithms
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
An early version of this work is available as a technical report on the University of Waterloo's Centre for Applied Cryptographic Research website and was presented at NIST's Second PQC Standardization ...
ACKNOWLEDGMENT This work was funded in part by the Natural Sciences and Engineering Research Council of Canada. ...
As a result, the comparison here is limited to those schemes for which one is provided. ...
doi:10.1109/access.2021.3077843
fatcat:o62peui5ufaybi4fnevrem5apq
Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol
2018
2018 IEEE International Symposium on Information Theory (ISIT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The resulting scheme exploits the cyclicity of the error, and benefits from the security of the renowned SIS problem. ...
This tweak allows to construct a lattice based key exchange analogous to the Ouroboros protocol for Hamming metric but with a reduction to the Short Integer Solution (SIS) problem. ...
It is meant to exchange (ephemeral) session keys using a public key encryption scheme. ...
doi:10.1109/isit.2018.8437940
dblp:conf/isit/DeneuvilleGGJ18
fatcat:q4xm4jh3yfgjjccssvzrqe7jqu
Performance of New Hope and CRYSTALS-Dilithium Postquantum Schemes in the Transport Layer Security Protocol
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENTS The authors would like to thank Jesus-Javier Chi-Domínguez and Luis Alberto Rivera-Zamarripa for helping us to develop the client-server interaction and the three anonymous reviewers for ...
their useful suggestions and careful reading of the manuscript. ...
In the case of computational power, we conclude that to balance the time-based attack surface of our postquantum proposal versus the classic TLS, 4.2 times the computing power is a straightforward benchmark ...
doi:10.1109/access.2020.3040324
fatcat:tkeqfby2jnattkm4me5cstfj4u
Encryption Scheme Based on Expanded Reed-Solomon Codes
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Considering shortened expanded codes provides a safeguard against distinguisher attacks based on the Schur product. ...
Moreover, without using a cyclic or a quasi-cyclic structure we obtain a key size reduction of nearly 45 % compared to the classic McEliece cryptosystem proposed by Bernstein et al. ...
The authors would like to thank Matthieu Lequesne and Jean-Pierre Tillich for pointing out the square code vulnerability in the case of quadratic extensions. ...
arXiv:1906.00745v4
fatcat:skbz5sumnvcsjoldb52awqrj2a
« Previous
Showing results 1 — 15 out of 36 results