A Digital Signature Scheme Based on Two Hard Problems

Dimitrios Poulakis () and Robert Rolland ()
Additional contact information
Dimitrios Poulakis: Aristotle University of Thessaloniki, Department of Mathematics
Robert Rolland: Université d’Aix-Marseille, Institut de Mathématiques de Marseille

A chapter in Computation, Cryptography, and Network Security, 2015, pp 441-450 from Springer

Abstract: Abstract In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides smaller signatures than the existing schemes based on the integer factorization and integer discrete logarithm problems.

Keywords: Digital signature; Integer factorization; Elliptic curve discrete logarithm; Supersingular elliptic curves; Pairing; Map to point function; Long-term security (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-319-18275-9_19

Ordering information: This item can be ordered from
http://www.springer.com/9783319182759

DOI: 10.1007/978-3-319-18275-9_19

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().