Asymptotic granularity reduction and its application (Q719278): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / 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: Q4830809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265362 / rank
 
Normal rank

Latest revision as of 12:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic granularity reduction and its application
scientific article

    Statements

    Asymptotic granularity reduction and its application (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    public key cryptosystem
    0 references
    transcendental logarithm problem
    0 references
    asymptotic granularity reduction
    0 references
    polynomial time reduction
    0 references
    provable security
    0 references

    Identifiers