Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (Q2489927): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.dam.2005.03.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090900392 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59163776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial representations of the Diffie-Hellman mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial representation of the Diffie-Hellman mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity profile of explicit nonlinear pseudorandom numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on discrete logarithms in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial representation for logarithms in GF(q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for explicit formulas for discrete logarithms in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete character sums and polynomial interpolation of the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number theoretic methods in cryptography. Complexity lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime divisors of sparse integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial form for logarithms modulo a prime (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the interpolation of the Diffie-Hellman mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interpolation of the discrete logarithm / rank
 
Normal rank

Latest revision as of 13:29, 24 June 2024

scientific article
Language Label Description Also known as
English
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
scientific article

    Statements

    Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bounds
    0 references
    0 references
    0 references