Results 101 to 110 of about 194 (126)

Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation

open access: closedJournal of Cryptographic Engineering, 2022
Efficient computation of polynomial multiplication over characteristic three fields is required for post-quantum cryptographic applications which gain importance upon the recent advances in quantum computers. In this paper, we propose three new polynomial multiplication algorithms over F-3 and show that they are more efficient than the current state-of-
Esra Yeniaras, Murat Cenk
openalex   +4 more sources

ANALYSIS OF ASYMMETRIC NTRU PRIME IIT UKRAINE ENCRYPTION ALGORITHM WITH REGARDS TO KNOWN ATTACKS

open access: closedTelecommunications and Radio Engineering (English Translation of Elektrosvyaz and Radiotekhnika), 2018
I D Gorbenko
exaly   +3 more sources

CALCULATION OF GENERAL PARAMETERS FOR NTRU PRIME UKRAINE OF 6-7 LEVELS OF STABILITY

open access: closedTelecommunications and Radio Engineering, 2019
І.Д. Горбенко   +7 more
openalex   +2 more sources

Generic Side-Channel Assisted Chosen-Ciphertext Attacks on Streamlined NTRU Prime.

open access: closedIACR Cryptol. ePrint Arch., 2021
Prasanna Ravi   +4 more
openalex   +2 more sources

METHODS OF BUILDING GENERAL PARAMETERS AND KEYS FOR NTRU PRIME UKRAINE OF 5TH – 7TH LEVELS OF STABILITY. PRODUCT FORM

open access: closedTelecommunications and Radio Engineering, 2019
І.Д. Горбенко   +5 more
openalex   +2 more sources

Correlation Power Analysis on NTRU Prime and Related Countermeasures.

open access: closedIACR Cryptol. ePrint Arch., 2019
Wei-Lun Huang   +2 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy