Results 131 to 140 of about 298 (166)
Some of the next articles are maybe not open access.
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 +3 more sources
On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP
Lecture Notes in Computer Science, 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.
Michał Wroński
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 +2 more sources
An intrusion-resilient signature scheme based on ECDLP
2010 IEEE International Conference on Information Theory and Information Security, 2010Intrusion-resilient signature schemes guarantee stronger security than forward-secure and key-insulated signature scheme. A novel intrusion-resilient signature scheme based on Elliptic Curve Discrete Logarithm Problem (ECDLP) is proposed. The proposed scheme combines the advantages of Elliptic Curve Digital Signature Algorithm (ECDSA) and intrusion ...
null Chenghua Li, null Xingbo Peng
exaly +2 more sources
An Attack for a 116bit ECDLP for a Barreto-Naehrig Curve
2023 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan), 2023Yasuyuki Nogami, Takuya Kusaka
exaly +2 more sources
A Secure Off-Line Electronic Cash Scheme Based on ECDLP
2009 First International Workshop on Education Technology and Computer Science, 2009The paper proposes a secure off-line electronic cash scheme based on ECDLP and gives a comprehensive analysis of its three sub protocols: withdrawal, payment, and deposit. It also proved the security of the scheme based on some cryptographic assumptions.
Zhan-gang Wang, Zhen-kai Wan
exaly +2 more sources
A Study on the Parameter of the Distinguished Point Method in Pollard’s Rho Method for ECDLP
2018 International Symposium on Information Theory and Its Applications (ISITA), 2018In this research, the choice of the parameter for a method to generate distinguished rational points in Pollard’s Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The structures of random walk paths are confirmed by experiments for several BN curves.
Yasuyuki Nogami +2 more
exaly +2 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
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 +1 more source
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 +1 more source