搜索结果: 1-15 共查到“密码学 elliptic curve”相关记录121条 . 查询时间(0.138 秒)
A new elliptic curve point compression method based on Fp-rationality of some generalized Kummer surfaces
elliptic cryptography point compression Barreto-Naehrig curves
2019/9/19
In the article we propose a new compression method (to 2log2(p)+32log2(p)+3 bits) for the Fp2Fp2-points of an elliptic curve Eb:y2=x3+bEb:y2=x3+b (for b∈F∗p2b∈Fp2∗) of jj-invariant ...
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem
RSA Cryptanalysis Coppersmith's method
2019/9/19
Let N=pqN=pq be an RSA modulus and ee be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed−k(p−1)(q−1)=1ed−k(p−1)(q...
Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem
public-key cryptography KMOV
2019/9/19
This paper presents two new improved attacks on the KMOV cryptosystem. KMOV is an encryption algorithm based on elliptic curves over the ring ZNZN where N=pqN=pq is a product of two large primes of eq...
A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem
Intersection of Curves Grobner Basis Vanishing Ideals
2019/9/19
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DL...
Distributing any Elliptic Curve Based Protocol: With an Application to MixNets
cryptographic protocols SPDZ
2019/7/8
We show how to perform a full-threshold nn-party actively secure MPC protocol over a subgroup of order pp of an elliptic curve group E(K)E(K). This is done by utilizing a full-threshold nn-party activ...
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
hash functions elliptic curve cryptosystem implementation
2019/4/23
Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family have experienced a resurgence in popularity due to their use in a number of real-world projects. One particular Barreto-Lynn-Scott cur...
Degenerate Fault Attacks on Elliptic Curve Parameters in OpenSSL
OpenSSL Elliptic curve cryptography Invalid curve attack
2019/4/22
In this paper, we describe several practically exploitable fault attacks against OpenSSL's implementation of elliptic curve cryptography, related to the singular curve point decompression attacks of B...
In search of CurveSwap: Measuring elliptic curve implementations in the wild
elliptic curve cryptography invalid curve attack curveswap
2018/3/30
We survey elliptic curve implementations from several vantage points. We perform internet-wide scans for TLS on a large number of ports, as well as SSH and IPsec to measure elliptic curve support and ...
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
public-key cryptography algorithm depends
2018/2/8
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve an...
Computational problems in supersingular elliptic curve isogenies
public-key cryptography supersingular elliptic curve isogenies
2017/8/16
We give a brief survey of elliptic curve isogenies and the computational problems relevant for supersingular isogeny crypto. Supersingular isogeny cryptography is attracting attention due to the fact ...
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...
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Quantum cryptanalysis elliptic curve cryptography elliptic curve discrete logarithm problem
2017/6/22
We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate netwo...
Condition on composite numbers easily factored with elliptic curve method
factoring number theory RSA
2017/5/12
For a composite integer NN that we would like to factor, we consider a condition for the elliptic curve method using NN as a scalar value to succeed and show that if NN has a prime factor pp such that...
On the Bit Security of Elliptic Curve Diffie--Hellman
hidden number problem bit security elliptic curve Diffie--Hellman
2017/1/3
This paper gives the first bit security result for the elliptic curve Diffie--Hellman key exchange protocol for elliptic curves defined over prime fields. About 5/65/6 of the most significant bits of ...
Elliptic Curve Cryptography (ECC) has gained much recognition over the last decades and has established itself among the well known public-key cryptography schemes, not least due its smaller key size ...