Efficient Compression of SIDH Public Keys (Q5738894): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient pairing computation on supersingular abelian varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure integration of asymmetric and symmetric encryption schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of Supersingular Isogeny Cryptosystems / 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: Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Montgomery inverse and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536791 / 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: Speeding the Pollard and Elliptic Curve Methods of Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Cryptography for the Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to do a 𝑝-descent on an elliptic curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arithmetic of Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure computation and discrete logarithms in finite abelian $p$-groups / 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 22:44, 13 July 2024

scientific article; zbMATH DE number 6729682
Language Label Description Also known as
English
Efficient Compression of SIDH Public Keys
scientific article; zbMATH DE number 6729682

    Statements

    Efficient Compression of SIDH Public Keys (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    post-quantum cryptography
    0 references
    Diffie-Hellman key exchange
    0 references
    supersingular elliptic curves
    0 references
    isogenies
    0 references
    SIDH
    0 references
    public-key compression
    0 references
    Pohlig-Hellman algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers