搜索结果: 1-9 共查到“Precomputation”相关记录9条 . 查询时间(0.078 秒)
Speeding up Elliptic Curve Scalar Multiplication without Precomputation
Elliptic curve cryptography Scalar multiplication Montgomery ladder
font style='font-size:12px;'>
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...
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...
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
discrete logarithm problem finite fields
font style='font-size:12px;'>
2016/1/6
In this paper, we revisit the recent small characteristic discrete logarithm algorithms. We show that a simplified description of the algorithm, together with some additional ideas, permits to obtain ...
Precomputation Methods for Faster and Greener Post-Quantum Cryptography on Emerging Embedded Platforms
Precomputation Post-Quantum Signatures Hash-based Signatures
font style='font-size:12px;'>
2015/12/31
Precomputation techniques are useful to improve realtime
performance of complex algorithms at the expense of extra
memory, and extra preparatory computations. This practice is neglected
especially ...
Symmetric Digit Sets for Elliptic Curve Scalar Multiplication without Precomputation
Gaussian integers Eisenstein integers
font style='font-size:12px;'>
2014/3/6
We describe a method to perform scalar multiplication on two classes of ordinary elliptic curves, namely $E: y^2 = x^3 + Ax$ in prime characteristic $p\equiv 1$ mod~4, and $E: y^2 = x^3 + B$ in prime ...
MAC Precomputation with Applications to Secure Memory
Message authentication code (MAC) MAC precomputation System on a Chip
font style='font-size:12px;'>
2009/7/22
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs
most of the computation prior to the availability of the message. Specifically, ShMAC’s message-
depend...
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
Elliptic curve cryptosystem scalar multiplication multiple scalar multiplication
font style='font-size:12px;'>
2009/6/11
We present an innovative technique to add elliptic curve points with the
form P ± Q , and discuss its application to the generation of precomputed tables for
the scalar multiplication. Our analysis ...
New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields（Full version）
Elliptic curve cryptosystem scalar multiplication point operation
font style='font-size:12px;'>
2009/6/2
We present a new methodology to derive faster composite operations of
the form dP+Q, where d is a small integer ≥ 2, for generic ECC scalar
multiplications over prime fields. In particular, we prese...
Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
affine coordinates elliptic curve cryptosystem precomputa-tion scalar multiplication
font style='font-size:12px;'>
2008/8/18
This paper presents a new approach to precompute all odd points [3]P, [5]P, [2k −1]P, k ≥ 2 on an elliptic curve over Fp. Those points are required for the efficient evaluation of a scalar multi...