Results 31 to 40 of about 453,861 (108)
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
IEEE Open Journal of the Communications Society, 2022 Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-
Johann-Philipp Thiers +1 more
doaj +1 more source
Survey of Graph Neural Networks and Applications
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 The advance of deep learning has shown great potential in applications (speech, image, and video classification). In these applications, deep learning models are trained by datasets in Euclidean space with fixed dimensions and sequences. Nonetheless, the rapidly increasing demands on analyzing datasets in non‐Euclidean space require additional research.
Fan Liang +5 more
wiley +1 more source
Quantum approximate optimization of the coset leader problem for binary linear codes
Computational and Mathematical Methods, Volume 3, Issue 6, November 2021., 2021 Abstract The security of a broad family of coding‐based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim is to find a word with a given syndrome and of Hamming weight smaller than a prefixed bound.
Markel Epelde +2 more
wiley +1 more source
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
Transactions on Cryptographic Hardware and Embedded Systems, 2021 This paper presents a side-channel analysis (SCA) on key encapsulation mechanism (KEM) based on the Fujisaki–Okamoto (FO) transformation and its variants.
Rei Ueno +5 more
doaj +1 more source
Quantum Election Protocol Based on Quantum Public Key Cryptosystem
Security and Communication Networks, Volume 2021, Issue 1, 2021., 2021 There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt‐freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in ...
Wenhua Gao, Li Yang, Prosanta Gope
wiley +1 more source
HLS-Based HW/SW Co-Design of the Post-Quantum Classic McEliece Cryptosystem
International Conference on Field-Programmable Logic and Applications, 2021 While quantum computers are rapidly becoming more powerful, the current cryptographic infrastructure is imminently threatened. In a preventive manner, the U.S.
Vatistas Kostalabros +4 more
semanticscholar +1 more source
A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme
Complexity, Volume 2020, Issue 1, 2020., 2020 Secret sharing has been study for many years and has had a number of real‐word applications. There are several methods to construct the secret‐sharing schemes. One of them is based on coding theory. In this work, we construct a secret‐sharing scheme that realizes an access structure by using linear codes, in which any element of the access structure ...
Ping Li +6 more
wiley +1 more source
Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information
Transactions on Cryptographic Hardware and Embedded SystemsThe McEliece cryptosystem is a strong contender for post-quantum schemes, including key encapsulation for confidentiality of key exchanges in network protocols.
Marcus Brinkmann +4 more
doaj +1 more source
Code based Cryptography: Classic McEliece
CoRR, 2019 This article addresses code-based cryptography and is designed to depict the complete outline of a code based public key cryptosystem. This report includes basic mathematics and fundamentals of coding theory which are useful for studying code-based cryptography.
openaire +2 more sources