Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791): Difference between revisions

From MaRDI portal
Added link to MaRDI 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-55227-9_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604299953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Optimum Pairing Products at High Security Levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Identity Based Encryption Scheme Based on Quadratic Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures from the Weil pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing-Friendly Elliptic Curves of Prime Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Pairings at the 192-Bit Security Level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adequate Elliptic Curves for Computing the Product of n Pairings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption Gone Wild / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroup Security in Pairing-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weil pairing, and its efficient calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Hashing to ${\mathbb G}_2$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of the LLL-Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank

Latest revision as of 23:46, 13 July 2024

scientific article; zbMATH DE number 6730155
Language Label Description Also known as
English
Adequate Elliptic Curves for Computing the Product of n Pairings
scientific article; zbMATH DE number 6730155

    Statements

    Adequate Elliptic Curves for Computing the Product of n Pairings (English)
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    BN curves
    0 references
    KSS16 curves
    0 references
    BLS curves
    0 references
    optimal ate pairing
    0 references
    product of \(n\) pairings
    0 references
    subgroup attacks
    0 references

    Identifiers