Breaking RSA may be as difficult as factoring (Q271594)

From MaRDI portal
Revision as of 01:50, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Breaking RSA may be as difficult as factoring
scientific article

    Statements

    title
    Breaking RSA may be as difficult as factoring (English)
    0 references
    author
    Daniel R. L. Brown
    0 references
    publication date
    7 April 2016
    0 references
    zbMATH Keywords
    RSA
    0 references
    factoring
    0 references
    straight line programs
    0 references

    Identifiers

    zbMATH DE Number
    6566226
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q271594&oldid=12156341"
    Powered by MediaWiki