Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q585615
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David D. W. Yao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100201258 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0811.0647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough Ramsey graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Cayley graphs and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Bounds for Primality Testing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit bounds for primes in residue classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the girth of Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Discriminants with the Brezing-Weng Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Topics in Computional Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Typen der Multiplikatorenringe elliptischer Funktionenkörper / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing modular polynomials in quasi-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of class polynomial computation via floating point approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737492 / 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: Constructing Isogenies between Elliptic Curves Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character sums in short intervals and the multiplication table modulo a large prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of values of \(L(1,\chi_d)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminants of Complex Multiplication Fields of Elliptic Curves over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / 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: Q3718617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252244 / 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: Counting points on elliptic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete logarithm problem on elliptic curves of trace one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms of Abelian varieties over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885340 / rank
 
Normal rank

Latest revision as of 14:06, 1 July 2024

scientific article
Language Label Description Also known as
English
Expander graphs based on GRH with an application to elliptic curve cryptography
scientific article

    Statements

    Expander graphs based on GRH with an application to elliptic curve cryptography (English)
    0 references
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    expander graphs
    0 references
    elliptic curves
    0 references
    isogenies
    0 references
    \(L\)-functions
    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
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references