A Digital Signature Scheme Based on Two Hard Problems
DOI10.1007/978-3-319-18275-9_19zbMath1368.94124OpenAlexW3123167884MaRDI QIDQ2790443
Robert Rolland, Dimitrios Poulakis
Publication date: 4 March 2016
Published in: Computation, Cryptography, and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18275-9_19
digital signaturepairinginteger factorizationsupersingular elliptic curveselliptic curve discrete logarithmlong-term securitymap to point function
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Factorization (11Y05)
Cites Work
- Computing bilinear pairings on elliptic curves with automorphisms
- A key distribution system equivalent to factoring
- Cyclicity statistics for elliptic curves over finite fields
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Efficient pairing computation on supersingular abelian varieties
- Remarks on some signature schemes based on factoring and discrete logarithms
- EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS
- The Eta Pairing Revisited
- Easy Decision Diffie-Hellman Groups
- The security of He and Kiesler's signature schemes
- Comment: Enhancing the security of El Gamal's signature scheme
- Security of a new digital signature scheme based on factoring and discrete logarithms
This page was built for publication: A Digital Signature Scheme Based on Two Hard Problems
