Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (Q1603445): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127179053, #quickstatements; #temporary_batch_1722357939539
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Q4249317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a determinate algorithm for the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature generation by smart cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707405 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00173-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053259405 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127179053 / rank
 
Normal rank

Latest revision as of 18:51, 30 July 2024

scientific article
Language Label Description Also known as
English
Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
scientific article

    Statements

    Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (English)
    0 references
    14 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational complexity
    0 references
    Cryptography
    0 references
    Discrete logarithm problem (DLP)
    0 references
    Generic algorithms
    0 references
    Generic complexity
    0 references
    Hardcore subsets
    0 references
    0 references
    0 references