搜索结果: 1-3 共查到“密码学 binary finite fields”相关记录3条 . 查询时间(0.046 秒)
Polynomial multiplication over binary finite fields: new upper bounds
Polynomial multiplication Karatsuba Two-level Seven-way Recursion algorithm
2018/1/29
When implementing a cryptographic algorithm, efficient operations have high relevance both in hardware and software. Since a number of operations can be performed via polynomial multiplication, the ar...
On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
implementation multiplication modular reduction
2017/9/18
In this paper we present a number of algorithms and optimization techniques to speedup computations in binary extension fields over GF(2). Particularly, we consider multiplication and modular reductio...
Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-channel Countermeasures
side-channel countermeasure masking polynomial evaluation
2016/1/6
We describe a new technique for evaluating polynomials over binary finite fields. This is useful in the context of anti-DPA countermeasures when an S-box is expressed as a polynomial over a binary fin...