z-logo
open-access-imgOpen Access
Optimization of polynomial multiplication algorithm for NTRU-like algorithms
Author(s) -
О.Г. Качко,
Ю.І. Горбенко,
Volodymyr Ponomar,
М.В. Єсіна,
С. О. Кандій
Publication year - 2020
Publication title -
radiotekhnika
Language(s) - English
Resource type - Journals
eISSN - 2786-5525
pISSN - 0485-8972
DOI - 10.30837/rt.2020.1.200.02
Subject(s) - ntru , cryptography , post quantum cryptography , computer science , algorithm , time complexity , multiplication (music) , timing attack , quantum computer , quantum algorithm , polynomial , theoretical computer science , mathematics , public key cryptography , encryption , quantum , cryptosystem , side channel attack , computer security , mathematical analysis , physics , combinatorics , quantum mechanics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom