Sparse polynomial multiplication for lattice-based cryptography with small complexity
Crossref DOI link: https://doi.org/10.1007/s11227-015-1570-1
Published Online: 2015-11-24
Published Print: 2016-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Akleylek, Sedat
Alkım, Erdem
Tok, Zaliha Yüce
Funding for this research was provided by:
TUBITAK (2219, 2214-A)
Deutsche Forschungsgemeinschaft (Crossing)
Text and Data Mining valid from 2015-11-24