Polynomial multiplication over binary finite fields: new upper bounds.
Alessandro De PiccoliAndrea ViscontiOttavio Giulio RizzoPublished in: J. Cryptogr. Eng. (2020)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- tight upper and lower bounds
- worst case
- unit interval
- finite number
- tight bounds
- branch and bound algorithm
- upper bounding
- low order
- non binary
- neural network
- efficiently computable
- concept classes
- computer vision
- hamming distance
- support vector
- arithmetic operations
- floating point
- binary valued
- error probability
- membership and equivalence queries
- branch and bound
- sample size
- special case