Results 161 to 170 of about 1,761 (191)

Constructing Weak Curves ECDLP-Equivalent to Ordinary Curves via Elliptic Surfaces

Proceedings of 2017 the 7th International Workshop on Computer Science and Engineering, 2017
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Development of Solving the ECDLP

2021 7th International Engineering Conference “Research & Innovation amid Global Pandemic" (IEC), 2021
The study and analysis of the Elliptic curve Discrete Logarithm Problem (ECDLP) is very important, because one of the strongest cryptosystems is based on this problem, which is elliptic curve cryptosystem. This aspect has led to make a clear change in cryptography and open new research field for treatment with special group that is the group of ...
openaire   +1 more source

Computational hardness of IFP and ECDLP

Applicable Algebra in Engineering, Communication and Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yasuda, Masaya, Shimoyama, Takeshi, Kogure, Jun, Izu, Tetsuya   +3 more
openaire   +2 more sources

An ECDLP based untraceable blind signature scheme

2013 International Conference on Circuits, Power and Computing Technologies (ICCPCT), 2013
In this paper we presents an Elliptic Curve Discrete Logarithm Problem (ECDLP) based blind signature scheme. Elliptic Curve Cryptosystem is the best known public-key cryptosystem till date, and is suitable for resource constrained environment because of smaller key size.
S. K. Nayak, B. Majhi, S. Mohanty
openaire   +1 more source

Improving ECDLP Computation in Characteristic 2

2020
Pollard 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, Zhijie Liu, Ping Wang, Haibo Tian   +3 more
openaire   +1 more source

On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP

2018
In 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, Tomasz Kijko
openaire   +1 more source

An ECDLP-Based Randomized Key RFID Authentication Protocol

2011 International Conference on Network Computing and Information Security, 2011
With the expansion of RFID technology application in diverse fields, the security problems attract more and more attention. In the RFID Security authentication protocols used public-key cryptography, the authentication protocol based on the ECDLP (Elliptic Curve Discrete Logarithm Problem) can solve the clone and reply attacks very well, but there are ...
Xinglei Zhang, Linsen Li, Yue Wu, Quanhai Zhang   +3 more
openaire   +1 more source

A Novel Protocol for Smart Card Using ECDLP

2008 First International Conference on Emerging Trends in Engineering and Technology, 2008
In 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 Kumar Panigrahy, Pradip Kumar Biswal, Sanjay Kumar Jena   +3 more
openaire   +1 more source

Solving ECDLP via List Decoding

2019
We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP. Then we propose an algorithm of finding the minimum weight codewords for algebraic geometry codes, especially for the elliptic code, via list decoding.
Fangguo Zhang, Shengli Liu
openaire   +1 more source

An intrusion-resilient signature scheme based on ECDLP

2010 IEEE International Conference on Information Theory and Information Security, 2010
Intrusion-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
openaire   +1 more source