Results 11 to 20 of about 1,865 (197)
Polynomial equation in algebraic attack on NTRU-HPS and NTRU-HRSS [PDF]
ITM Web of ConferencesNTRU is a lattice-based public-key cryptosystem designed by Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Paradise Fadila, Sugeng Kiki Ariyanti
doaj +3 more sources
Applied Mathematics and Nonlinear Sciences, 2021 As a cryptosystem, Nth Truncated Polynomial Ring (NTRU) is established on the fast and easy calculation. Improving the security is aimed by enlarging a ring where the processes execute and enhancing the nwnber of a private key and a public key.
ÖZDEMİR, AHMET ŞÜKRÜ
core +6 more sources
NTRU-ν-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022 NTRUEncrypt is one of the first lattice-based encryption schemes. Furthermore, the earliest fully homomorphic encryption (FHE) schemes rely on the NTRU problem.
Kamil Kluczniak (17287801)
core +4 more sources
An NTRU-like Message Recoverable Signature Algorithm
MathematicsAn important feature of Nyberg-Rueppel type digital signature algorithms is message recovery, this signature algorithm can recover the original information from the signature directly by the verifier in the verification phase after signing the message ...
Tingle Shen, Li Miao, Bin Hua, Shuai Li
doaj +2 more sources
Multi-Parameter Support with NTTs for NTRU and NTRU Prime on Cortex-M4
Transactions on Cryptographic Hardware and Embedded Systems, 2022 We propose NTT implementations with each supporting at least one parameter of NTRU and one parameter of NTRU Prime. Our implementations are based on size-1440, size-1536, and size-1728 convolutions without algebraic assumptions on the target polynomial ...
Erdem Alkim, Vincent Hwang, Bo-Yin Yang
doaj +7 more sources
HPMA-NTRU: high-performance polynomial multiplication accelerator for NTRU
2022 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), 2022 Along the rapid development of large-scale quantum computers, post-quantum cryptography (PQC) has drawn significant attention from research community recently as it is proven that the existing public-key cryptosystems are vulnerable to the quantum ...
Xie, Jiafeng +4 more
core +3 more sources
Will You Cross the Threshold for Me?
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this work, we propose generic and novel side-channel assisted chosenciphertext attacks on NTRU-based key encapsulation mechanisms (KEMs). These KEMs are IND-CCA secure, that is, they are secure in the chosen-ciphertext model.
Prasanna Ravi +4 more
doaj +1 more source
NTRU-type fully homomorphic encryption scheme without key switching
网络与信息安全学报, 2017 In order to construct a fully homomorphic encryption scheme based on NTRU cryptosystem from ring learning with errors, noise growth and homomorphic property in the NTRU cryptosystem were analyzed. The con-cept of zero homomorphic encryption was introdced
Xin-xia SONG +2 more
doaj +3 more sources
Security Analysis of Hybrid Attack for NTRU-Class Encryption Schemes
IEEE Access, 2023 One of the significant post-quantum cryptographic candidates is the NTRU public key cryptosystem. It operates on polynomial rings, where the parameter largely determines the security of the system.
Alla Levina +2 more
doaj +1 more source
Characterizing overstretched NTRU attacks [PDF]
Journal of Mathematical Cryptology, 2020 Abstract Overstretched NTRU is a variant of NTRU with a large modulus. Recent lattice subfield and subring attacks have broken suggested parameters for several schemes. There are a number of conflicting claims in the literature over which attack has the best performance.
Gabrielle De Micheli +2 more
openaire +3 more sources