Results 61 to 70 of about 179 (152)
On Accuracy of Testing Decryption Failure Rate for Encryption Schemes under the LWE Assumption
IET Information Security, Volume 2024, Issue 1, 2024.Lattice‐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. We quantitatively analyze how the floating‐point arithmetic and neglecting small probabilities impact the precision, and propose a new ...
Lin Wang +3 more
wiley +1 more source
Fast and Power-Analysis Resistant Ring Lizard Crypto-Processor Based on the Sparse Ternary Property
IEEE Access, 2019 Ring Lizard (RLizard) is a quantum-resistant public-key cryptosystem based on the ideal lattice. RLizard uses a sparse ternary polynomial, which facilitates implementation with lower complexity.
Piljoo Choi, Ji-Hoon Kim, Dong Kyue Kim
doaj +1 more source
A MULTI-DIMENSIONAL ALGEBRA FOR DESIGNING AN IMPROVED NTRU CRYPTOSYSTEM
EURASIAN JOURNAL OF MATHEMATICAL AND COMPUTER APPLICATIONS, 2020 The NTRU public key cryptosystem is essentially based on the Nth degree trun- cated polynomial ring Z[X]/XN−1 . By altering the Z[X]/XN−1 or its mathematical con- struction, many researchers have worked to improve NTRU. In this paper, we present a new multi-dimensional public key cryptosystem which depends on a commutative quaternion al- gebra with a
H.R. Yassein +2 more
openaire +1 more source
IEEE AccessThe emergence of large-scale quantum computers threatens the long-term security of classical public-key cryptosystems, making the integration of post-quantum cryptography (PQC) essential for resource-constrained embedded and IoT platforms.
Tri-Duc Ta +3 more
doaj +1 more source
Enhancing the NTRU Cryptosystem
International Journal of Computer Applications, 2020 Unnikrishnan Menon, Awnon Bhowmik
openaire +1 more source
On the NTRU public key cryptosystem
, 2020 NTRU is a public key cryptosystem which was first introduced in 1996. It is a ring-based cryptosystem and its security relies on the complexity of a well-known lattice problem, i.e. shortest vector problem (SVP). There is no efficient algorithm known to solve SVP exactly in arbitrary high dimensional lattices.
openaire +1 more source
Indistinguishability under adaptive chosen-ciphertext attack secure double-NTRU-based key encapsulation mechanism. [PDF]
PeerJ Comput Sci, 2023 Seyhan K, Akleylek S.
europepmc +1 more source
Resilience Optimization of Post-Quantum Cryptography Key Encapsulation Algorithms. [PDF]
Sensors (Basel), 2023 Farooq S +6 more
europepmc +1 more source
A systematic review of homomorphic encryption and its contributions in healthcare industry. [PDF]
Complex Intell Systems, 2022 Munjal K, Bhatia R.
europepmc +1 more source
A Comparative Study of Post-Quantum Cryptosystems for Internet-of-Things Applications. [PDF]
Sensors (Basel), 2022 Septien-Hernandez JA +3 more
europepmc +1 more source