搜索结果: 1-15 共查到“军事学 Scalar Multiplication”相关记录50条 . 查询时间(0.102 秒)
Fast Scalar Multiplication for Elliptic Curves over Prime Fields by Efficiently Computable Formulas
twisted Edwards curves Edwards curves scalar multiplication
2018/11/6
This paper addresses fast scalar multiplication for elliptic curves over finite fields. In the first part of the paper, we obtain several efficiently computable formulas for basic elliptic curves arit...
Template Attack on Blinded Scalar Multiplication with Asynchronous perf-ioctl Calls
Scalar Multiplication Scalar Splitting Scalar Blinding
2017/10/9
In recent years, performance counters have been used as a side channel source for the branch mispredictions which has been used to attack ciphers with user privileges. However, existing research consi...
Scalar multiplication in compressed coordinates in the trace-zero subgroup
elliptic curve cryptography trace-zero subgroup
2017/9/18
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the...
Fast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas
binary elliptic curves point multiplication lambda coordinates
2017/9/7
This paper considers efficient scalar multiplication of elliptic curves over binary fields with a twofold purpose. Firstly, we derive the most efficient 3P3P formula in λλ-projective coordinates and 5...
Speeding up Elliptic Curve Scalar Multiplication without Precomputation
Elliptic curve cryptography Scalar multiplication Montgomery ladder
2017/7/11
This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierstrass curves over odd characteristic fields, which need only 12 field multiplications plus 12 ~ 20 fi...
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper's multiply-by-n algorithm takes ...
Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers
Hyperelliptic curve cryptography Kummer surface genus 2
2016/12/10
We give one- and two-dimensional scalar multiplication algorithms for Jacobians of genus~2 curves that operate by projecting to Kummer surfaces, where we can exploit faster and more uniform pseudomult...
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains
Parallel Algorithms Elliptic Curve Cryptography Scalar Multiplication
2016/12/9
This paper presents parallel scalar multiplication techniques for elliptic curve cryptography using q-based addition-subtraction k-chain which can also effectively resist side-channel attack. Many tec...
Randomized Mixed-Radix Scalar Multiplication
Elliptic curve arithmetic Side-channel attacks
2016/12/7
A covering system of congruences can be defined as a set of congruence relations of the form: {r1(modm1),r2(modm2),…,rt(modmt)}{r1(modm1),r2(modm2),…,rt(modmt)} for m1,…,mt∈Nm1,…,mt∈N satisfying the p...
Fast GPGPU-Based Elliptic Curve Scalar Multiplication
fast implementation scalar multiplication
2016/1/25
This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a ``General-Purpose computing on Graphics Processing Units'' (GPGPU) approach. A GPU im...
A Note on Scalar Multiplication Using Division Polynomials
elliptic curve cryptosystems division polynomial elliptic net
2015/12/31
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this paper we improve
the efficiency of the Elliptic Net algorithm to compute scalar multiplica...
VLSI Implementation of Double-Base Scalar Multiplication on a Twisted Edwards Curve with an Efficiently Computable Endomorphism
Multiple-precision arithmetic Pseudo-Mersenne prime
2015/12/30
The verification of an ECDSA signature requires a double-base scalar multiplication, an operation of the form k⋅G+l⋅Q where G is a generator of a large elliptic curve group of prime order ...
Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences
Scalar Multiplication Covering Systems of Congruences Side-Channel Attacks
2015/12/30
In this paper we present a generic, uniformly randomized scalar multiplication
algorithm based on covering systems of congruences, with built-in protections against various
side-channel attacks. It ...
Faster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p?
Edwards curves Twisted Edwards curves Finite 謊lds
2015/12/22
In this paper we present a new method for fast scalar multiplication on elliptic
curves over GF(p) in FPGA using Edwards and twisted Edwards curves
over GF(p
3
). The presented solution works for ...
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes
elliptic curve cryptography hyperelliptic curve cryptography scalar multiplication
2015/12/22
We give a general framework for uniform, constant-time oneand
two-dimensional scalar multiplication algorithms for elliptic curves
and Jacobians of genus 2 curves that operate by projecting to the x...