Results 151 to 160 of about 701 (185)
Some of the next articles are maybe not open access.
An Attack for a 116bit ECDLP for a Barreto-Naehrig Curve
2023 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan), 2023Takuya Kusaka
exaly +2 more sources
Computational hardness of IFP and ECDLP
Applicable Algebra in Engineering, Communications and Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masaya Yasuda +2 more
exaly +4 more sources
Recent Advances in the Index Calculus Method for Solving the ECDLP
Algorithms for Intelligent Systems, 2023Shalini Bajaj +2 more
exaly +2 more sources
Improving ECDLP Computation in Characteristic 2
2020Pollard rho and its parallelized variants are at present known as the best generic algorithms for computing discrete logarithms in groups of elliptic curves over finite fields. The \(r+h\)-mixed walk, one of the variant parallelized rho method in characteristic 2, is expected to have r times point addition operations and h times point halving ...
Fangguo Zhang +3 more
openaire +2 more sources
On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP
2018In this article the attack on elliptic curve discrete logarithm problem (ECDLP) with partial information is considered. If unknown bits of discrete logarithm are continuous then 1-dimensional algorithms for ECDLP may be used. One of these algorithms is improved Gaudry-Schost using equivalence classes which requires \(O(1.47\sqrt{n}) \) operations.
Michal Wronski, Tomasz Kijko
openaire +2 more sources
Cryptanalysis and improvement of a ECDLP based proxy blind signature scheme
Journal of Discrete Mathematical Sciences and Cryptography, 2018 [[abstract]]The proxy blind signature scheme (PBSS), allows the authorized proxy signer to use his proxy private key to create a legal blind signature on behalf of original signer.
Cheng-Chi Lee, Chun-Ta Li
exaly +1 more source
On the Strength Comparison of the ECDLP and the IFP
2012At present, the RSA cryptosystem is most widely used in public key cryptography. On the other hand, elliptic curve cryptography (ECC) has recently received much attention since smaller ECC key sizes provide the same security level as RSA. Although there are a lot of previous works that analyze the security of ECC and RSA, the comparison of strengths ...
Masaya Yasuda +3 more
openaire +2 more sources
A Novel Protocol for Smart Card Using ECDLP
2008 First International Conference on Emerging Trends in Engineering and Technology, 2008In this paper, we propose a novel protocol for smart card based on elliptic curve discrete logarithm problem (ECDLP). We believe that applications of smart card technology should be benefited more from advantages of public key cryptography, specifically, in initiation and maintenance of secure channel.
Debasish Jena, Saroj Panigrahy
exaly +2 more sources
Pollard's rho attack on ECDLP and Threshold Schemes
Monte Carlo Methods and Applications, 2007A threshold secret sharing scheme is one in which a piece of information is shared among a group of t persons such that, any k number of them for k ≤ t pool in their shares to recover the secret. In this paper, we propose a suitable technique for a (2, t)-threshold scheme that is based on a cryptanalytic attack of the Elliptic Curve Discrete Logarithm ...
exaly +3 more sources
Quantum Attacks on ECDLP-Based Cryptosystems
2013In this chapter we shall first study the elliptic curve discrete logarithm problem (ECDLP) and the classical solutions to ECDLP, and then we shall discuss some of the most popular ECDLP-based cryptographic systems for which there is no efficient cryptanalytic algorithm.
Song Y Yan
exaly +2 more sources