搜索结果: 1-6 共查到“密码学 square root”相关记录6条 . 查询时间(0.109 秒)
Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations?
ECDLP Square Root Bound
2019/7/15
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field Fp2Fp2. Using the representation technique, we reduce ECDLP to a multivariate polynomial ...
We introduce a new type of Montgomery-like square root formulae in GF(2m)GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By c...
We present a square root algorithm in F_q which generalizes Atkins's square root algorithm for q=5(mod 8) and Kong et al.'s algorithm for q=9(mod 16) Our algorithm precomputes a primitive 2^s-th root ...
The Computational Square-Root Exponent Problem- Revisited
Computational Square-Root Exponent Problem- Revisited Computational Diffie-Hellman Problem
2012/3/28
n this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Pro...
The Computational Square-Root Exponent Problem- Revisited
Diffie-Hellman problem square Diffie-Hellman problem squareroot exponent problem equivalence order
2011/6/9
In this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Pr...
Low Complexity Bit-Parallel Square Root Computation over GF(2m) for all Trinomials
Finite field arithmetic binary extension fields cryptography
2008/11/13
In this contribution we introduce a low-complexity bit-parallel algorithm
for computing square roots over binary extension fields. Our proposed
method can be applied for any type of irreducible poly...