Breaking RSA Generically Is Equivalent to Factoring (Q5901923): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1007/978-3-642-01001-9_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1579491709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Black-Box Fields and their Application to Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking RSA may not be equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking RSA may be as difficult as factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When e-th Roots Become Easier Than Factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generation of prime numbers and secure public-key cryptographic parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The RSA Group is Pseudo-Free / 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: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 1 July 2024

scientific article; zbMATH DE number 5552767
Language Label Description Also known as
English
Breaking RSA Generically Is Equivalent to Factoring
scientific article; zbMATH DE number 5552767

    Statements

    Identifiers