搜索结果: 1-9 共查到“binary elliptic curves”相关记录9条 . 查询时间(0.145 秒)
A SAT-based approach for index calculus on binary elliptic curves
discrete logarithm index calculus elliptic curves
font style='font-size:12px;'>
2019/3/22
Logical cryptanalysis, first introduced by Massacci in 2000, is a viable alternative to common algebraic cryptanalysis techniques over boolean fields. With XOR operations being at the core of many cry...
The Montgomery ladder on binary elliptic curves
GLS Intel Skylake machine
font style='font-size:12px;'>
2017/4/27
In this survey paper we present a careful analysis of the Montgomery ladder procedure applied to the computation of the constant-time point multiplication operation on elliptic curves defined over bin...
On Splitting a Point with Summation Polynomials in Binary Elliptic Curves
cryptanalysis summation polynomials algebraic attacks
font style='font-size:12px;'>
2016/1/27
Recent research for efficient algorithms for solving the discrete
logarithm (DL) problem on elliptic curves depends on the difficult
question of the feasibility of index calculus which would consist...
Fast point multiplication algorithms for binary elliptic curves with and without precomputation
binary elliptic curves scalar multiplication software implementation
font style='font-size:12px;'>
2016/1/9
In this paper we introduce new methods for computing constant-time variable-base
point multiplications over the Galbraith-Lin-Scott (GLS) and the Koblitz families of elliptic
curves. Using a left-to...
Point Decomposition Problem in Binary Elliptic Curves
Semaev polynomials elliptic curves point decomposition problem
font style='font-size:12px;'>
2015/12/31
We analyze the point decomposition problem (PDP) in binary elliptic
curves. It is known that PDP in an elliptic curve group can be reduced to solving
a particular system of multivariate non-linear s...
A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves
implementation
font style='font-size:12px;'>
2014/3/10
Efficient implementation of double point multiplication is crucial for elliptic curve cryptographic systems. We revisit three recently proposed simultaneous double point multiplication algorithms. We ...
Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
Elliptic curve cryptography finite field arithmetic parallel algorithm efficient software implementation
font style='font-size:12px;'>
2012/3/29
The availability of a new carry-less multiplication instruction in the latest Intel desktop processors significantly accelerates multiplication in binary fields and hence presents the opportunity for ...
A New Model of Binary Elliptic Curves with Fast Arithmetic
Elliptic curve binary field scalar multiplication unified addition law differential addition cryptography
font style='font-size:12px;'>
2010/11/30
This paper presents a new model of ordinary elliptic curves with fast arithmetic over field of characteristic two. In addition, we propose two isomorphism maps between new curves and Weierstrass curve...
A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves
parallelized Pollard lambda elliptic curves prime finite fields binary elliptic curves
font style='font-size:12px;'>
2009/4/9
Let E be an elliptic curve defined over a prime finite field Fp by a
Weierstrass equation. In this paper we introduce a new partition of E(Fp)
into classes which are generally larger than f§Rg. We g...