Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (Q2759107): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum distance of some quadratic residue codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Diffie-Hellman Key Agreement with Short Exponents / rank
 
Normal rank

Latest revision as of 20:45, 3 June 2024

scientific article
Language Label Description Also known as
English
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
scientific article

    Statements

    Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (English)
    0 references
    10 December 2001
    0 references
    discrete logarithm problem
    0 references
    baby-step giant-step algorithm
    0 references
    splitting system
    0 references
    0 references

    Identifiers