A Digital Signature Scheme Based on Two Hard Problems (Q2790443): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-18275-9_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3123167884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pairing computation on supersingular abelian varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on some signature schemes based on factoring and discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy Decision Diffie-Hellman Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comment: Enhancing the security of El Gamal's signature scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The security of He and Kiesler's signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A key distribution system equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security of a new digital signature scheme based on factoring and discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclicity statistics for elliptic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing bilinear pairings on elliptic curves with automorphisms / rank
 
Normal rank

Latest revision as of 12:44, 11 July 2024

scientific article
Language Label Description Also known as
English
A Digital Signature Scheme Based on Two Hard Problems
scientific article

    Statements

    A Digital Signature Scheme Based on Two Hard Problems (English)
    0 references
    0 references
    0 references
    4 March 2016
    0 references
    digital signature
    0 references
    integer factorization
    0 references
    elliptic curve discrete logarithm
    0 references
    supersingular elliptic curves
    0 references
    pairing
    0 references
    map to point function
    0 references
    long-term security
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references