Results 11 to 20 of about 130 (55)
IET Information Security, Volume 15, Issue 6, Page 472-486, November 2021., 2021 Abstract Multi‐key fully homomorphic encryption (MKFHE) allows computations on ciphertexts encrypted by different users, which can be applied to implement secure multi‐party computing (MPC). The current NTRU‐based MKFHE has the following two drawbacks: One is that the relinearisation process during homomorphic evaluation is so complicated that the ...
TanPing Zhou +5 more
wiley +1 more source
Efficiently Masking Polynomial Inversion at Arbitrary Order [PDF]
, 2022 Physical side-channel analysis poses a huge threat to post-quantum cryptographic schemes implemented on embedded devices. Still, secure implementations are missing for many schemes.
Georg Land +3 more
core
Post-quantum cryptographic algorithm identification using machine learning [PDF]
, 2022 This research presents a study on the identification of post-quantum cryptography algorithms through machine learning techniques. Plain text files were encoded by four postquantum algorithms, participating in NIST's post-quantum cryptography ...
Rocha, Bruno dos Santos
core
Cryptanalysis of an NTRU-based Proxy Encryption Scheme from ASIACCS\u2715 [PDF]
, 2019 In ASIACCS 2015, Nuñez, Agudo, and Lopez proposed a proxy re-encryption scheme, NTRUReEncrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator\u27s public key into a re-encrypted ciphertext that can be decrypted correctly ...
A Hülsing +10 more
core +1 more source
Message Recovery Attack in NTRU through VFK Lattices
, 2023 In the present paper, we implement a message recovery attack to all variants of the NTRU cryptosystem. Our approach involves a reduction from the NTRU-lattice to a Voronoi First Kind lattice, enabling the application of a polynomial CVP exact algorithm ...
Adamoudis, Marios +3 more
core
A Thorough Treatment of Highly-Efficient NTRU Instantiations [PDF]
, 2021 Cryptography based on the hardness of lattice problems over polynomial rings currently provides the most practical solution for public key encryption in the quantum era. The first encryption scheme utilizing properties of polynomial rings was NTRU (ANTS
Dominique Unruh +5 more
core
Аналіз актуальних проблемних питань щодо перспективної асиметричної криптографії [PDF]
, 2019 Наведений аналіз актуальних досліджень щодо криптографії на решітках. Аналіз відбувається відповідно до найбільш актуальних алгоритмів, що пройшли до другого етапу конкурсу NIST США. Деякі з них комбіновані — включають в себе декілька схожих алгоритмів з
Акользіна, О.С. +2 more
core +3 more sources
Implementation and Benchmarking of Round 2 Candidates in the NIST Post-Quantum Cryptography Standardization Process Using Hardware and Software/Hardware Co-design Approaches [PDF]
, 2020 Performance in hardware has typically played a major role in differentiating among leading candidates in cryptographic standardization efforts. Winners of two past NIST cryptographic contests (Rijndael in case of AES and Keccak in case of SHA-3) were ...
Duc Tri Nguyen +5 more
core
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model [PDF]
, 2019 The recent post-quantum cryptography standardization project launched by NIST increased the interest in generic key encapsulation mechanism (KEM) constructions in the quantum random oracle (QROM).
A Hülsing +17 more
core +1 more source
A Comparison of NTRU Variants [PDF]
, 2018 We analyze the size vs. security trade-offs that are available when selecting parameters for perfectly correct key encapsulation mechanisms based on ...
John M. Schanck
core