Efficient Tate pairing computation using double-base chains (Q954437): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11432-008-0070-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036165685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / 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: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of Miller's algorithm for computing the Weil/Tate pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413332 / 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: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the low Hamming weight discrete logarithm problem for nonadjacent representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading inversions for multiplications in elliptic curve cryptography / rank
 
Normal rank

Latest revision as of 20:02, 28 June 2024

scientific article
Language Label Description Also known as
English
Efficient Tate pairing computation using double-base chains
scientific article

    Statements

    Efficient Tate pairing computation using double-base chains (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2008
    0 references
    0 references
    public key cryptography
    0 references
    Tate pairing
    0 references
    elliptic curves
    0 references
    double-base chains
    0 references
    0 references