C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Sparse polynomial multiplication for lattice-based cryptography with small complexity.
Sedat Akleylek
Erdem Alkim
Zaliha Yüce Tok
Published in:
J. Supercomput. (2016)
Keyphrases
</>
small number
polynomial hierarchy
high dimensional
vapnik chervonenkis dimension
cellular automata
computational complexity
sparse representation
space complexity
sparse data
low order
face recognition
computational cost
floating point
complexity analysis
polynomial size