Results 1 to 10 of about 10,693 (203)
On Accuracy of Testing Decryption Failure Rate for Encryption Schemes under the LWE Assumption
IET Information SecurityLattice-based encryption schemes are significant cryptographic primitives to defend information security against quantum menace, and the decryption failure rate is related to both theoretical and realistic security.
Lin Wang, Yang Wang, Huiwen Jia
doaj +2 more sources
Efficient face information encryption and verification scheme based on full homomorphic encryption [PDF]
Scientific ReportsEmerging global privacy mandates enforce strict requirements for biometric data protection, requiring encrypted processing throughout storage and computation phases.
Yijia Chen +7 more
doaj +2 more sources
How to Construct Polar Codes for Ring-LWE-Based Public Key Encryption
Entropy, 2021 There exists a natural trade-off in public key encryption (PKE) schemes based on ring learning with errors (RLWE), namely: we would like a wider error distribution to increase the security, but it comes at the cost of an increased decryption failure rate
Jiabo Wang, Cong Ling
doaj +1 more source
Polar Codes for Module-LWE Public Key Encryption: The Case of Kyber
Cryptography, 2023 In modern society, the Internet is one of the most used means of communication. Thus, secure information transfer is inevitably of major importance.
Iason Papadopoulos, Jiabo Wang
doaj +1 more source
Моделирование и анализ информационных систем, 2023 The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko +4 more
doaj +1 more source
Analysis of Error Dependencies on Newhope
IEEE Access, 2020 Among many submissions to NIST post-quantum cryptography (PQC) project, NewHope is a promising key encapsulation mechanism (KEM) based on the Ring-Learning with errors (Ring-LWE) problem.
Minki Song +5 more
doaj +1 more source
General Impossibility of Group Homomorphic Encryption in the Quantum World [PDF]
, 2014 Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.
Armknecht, Frederik +3 more
core +7 more sources
LEDAcrypt: QC-LDPC Code-Based Cryptosystems with Bounded Decryption Failure Rate [PDF]
, 2019 We consider the QC-LDPC code-based cryptosystems named LEDAcrypt, which are under consideration by NIST for the second round of the post-quantum cryptography standardization initiative. LEDAcrypt is the result of the merger of the key encapsulation mechanism LEDAkem and the public-key cryptosystem LEDApkc, which were submitted to the first round of the
M. Baldi +4 more
openaire +1 more source
Analysis of common attacks in LDPCC-based public-key cryptosystems [PDF]
, 2003 We analyze the security and reliability of a recently proposed class of public-key cryptosystems against attacks by unauthorized parties who have acquired partial knowledge of one or more of the private key components and/or of the plaintext.
D. Saad +17 more
core +2 more sources
Dynamic adversarial neural cryptography for ensuring privacy in smart contracts [PDF]
PeerJ Computer ScienceVarious types of research are being carried out to advance in the field of cryptography and develop a more robust technique for security. Adversarial neural cryptography (ANC) is a recent development in this extension, which possesses huge potential to ...
Basil Hanafi +4 more
doaj +2 more sources