Pollard's rho attack on ECDLP and Threshold Schemes

Vidya K. P. ()
Additional contact information
Vidya K. P.: Email: kpvidya@hotmail.com

Monte Carlo Methods and Applications, 2007, vol. 13, issue 3, 245-252

Abstract: A 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 Problem (ECDLP). This scheme can be used in applications where two or more persons among a group of t ≥ 2 may combine to carry out a critical action such as, opening the door to the bank vault. We illustrate the application of our scheme to ATM cards.

Keywords: Cryptography; threshold scheme; elliptic curve; ECDLP; Pollard's rho attack on ECDLP. (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/mcma.2007.013 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:13:y:2007:i:3:p:245-252:n:5

Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/mcma/html

DOI: 10.1515/mcma.2007.013

Access Statistics for this article

Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld

More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().