Parallelizing the Weil and Tate Pairings (Q3104701): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Barreto-Naehrig / rank
 
Normal rank
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-642-25516-8_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W54640647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Explicit Formulas for Computing Pairings over Ordinary Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Speed Parallel Software Implementation of the η T Pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets / 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: Selected Areas in Cryptography / 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: A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECC2K-130 on Cell CPUs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Pairing Computations on Curves with High-Degree Twists / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairings for cryptographers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and optimal exponentiation in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Software Parallel Implementation of Cryptographic Pairings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ate Pairing on Hyperelliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Generalized Pairing Computation on Abelian Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940686 / 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: Five, six, and seven-term Karatsuba-like formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Software Speed Records for Cryptographic Pairings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Variable χ–Based Ate Pairing / 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: Optimal Pairings / rank
 
Normal rank

Latest revision as of 18:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Parallelizing the Weil and Tate Pairings
scientific article

    Statements

    Parallelizing the Weil and Tate Pairings (English)
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references