Pairing-based cryptography on elliptic curves (Q1616164): 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/s11786-018-0347-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2810305017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves and Primality Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm / 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: Q4265362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Elliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curves suitable for pairing based cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of pairing-friendly elliptic curves / 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: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5449746 / 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: The Weil pairing, and its efficient calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curves with<i>j</i>= 0,1728 and low embedding degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Cryptosystems and Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems / rank
 
Normal rank

Latest revision as of 05:06, 17 July 2024

scientific article
Language Label Description Also known as
English
Pairing-based cryptography on elliptic curves
scientific article

    Statements

    Pairing-based cryptography on elliptic curves (English)
    0 references
    0 references
    0 references
    0 references
    1 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    elliptic curves
    0 references
    pairings
    0 references
    Weil pairing
    0 references
    identity-based cryptography
    0 references
    embedding degree
    0 references
    pairing-friendly elliptic curves
    0 references
    0 references