"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
RSA and Public-Key Cryptography	Richard A. Mollin	2002	Routledge
A polynomial-time algorithm for computing the yolk in fixed dimension	Craig A. Tovey	1991	Naval Postgraduate School;Available from National Technical Information Service
Moving many pebbles in a graph is polynomial time	Paul G. Spirakis	1983	Courant Institute of Mathematical Sciences, New York University
Now is the time to use the master key	Edith Fritz Bartoe	1979	[ESPress]
Factoring	Webster Wells	1902	D. C. Heath & co.
Factoring	Melvyn Westlake	1975	Pitman
Factoring	Webster Wells	1902	D. C. Heath & co.
George's secret key to the universe	Lucy Hawking; Stephen Hawking	2007	Ted Smart
George's Secret Key to the Universe	Stephen Hawking	Jul 10, 2001	Corgi Childrens
Eckankar: the key to secret worlds	Paul Twitchell	1969	Illuminated Way Press
Eckankar: the key to secret worlds	Paul Twitchell	1969	Lancer Books
George's Secret Key to the Universe	Stephen Hawking; Lucy Hawking	2007	Doubleday;Doubleday Children's Books;Simon & Schuster
Deterministic and Stochastic Time-Delay Systems	El-Kebir Boukas; Zi-Kuan Liu	2002	Birkhäuser Boston
Primality Testing in Polynomial Time: From Randomized Algorithms to " PRIMES Is in P"	Martin Dietzfelbinger	2004	Springer Berlin Heidelberg
The Joy of Factoring	Samuel S. Wagstaff; Jr.	Nov 22, 2013	American Mathematical Society
A factorization procedure that is equivalent to successive over relaxation	Martin A. Diamond	1971	Dept. of Computer Science, University of Illinois at Urbana-Champaign
American factoring law	David B. Tatge	2009	BNA Books
Factoring and finance	Martin Forman	1976	Heinemann;William Heinemann Ltd
Secret of the skeleton key	Justin VanRiper	2006	Adirondack Kids Press
Secret key masters: extempore /	Gees, Michael,; Ehlhart, Frans,; Tilzer, Marion von,
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring	Alexander May	Advances in Cryptology - CRYPTO 2004: 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings	Matt Franklin	2004	Springer Berlin Heidelberg
Breaking RSA Generically Is Equivalent to Factoring	Divesh Aggarwal; Ueli Maurer	Advances in Cryptology – EUROCRYPT 2009: 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009, Proceedings	Antoine Joux	2009	Springer Berlin Heidelberg
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA	Noboru Kunihiro; Kaoru Kurosawa	Public Key Cryptography - PKC 2007: 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, Proceedings	Tatsuaki Okamoto; Xiaoyun Wang	2007	Springer Berlin Heidelberg
Breaking RSA may not be equivalent to factoring	Dan Boneh; Ramarathnam Venkatesan	Advances in Cryptology – EUROCRYPT ' 98: International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceedings	Kaisa Nyberg	1998	Springer Berlin Heidelberg
RSA Factoring Challenge	Burt Kaliski Jr.	Encyclopedia of Cryptography and Security	Henk C.A. van Tilborg; Sushil Jajodia	2nd ed. 2011	Springer US
RSA factoring challenge	Burt Kaliski	Encyclopedia of Cryptography and Security	Henk C.A. van Tilborg		Springer US
RSA Factoring Challenge		Ethical hacking and countermeasures. Book 4 of 4, Secure network operating systems and infrastructures	EC-Council Press,; International Council of E-Commerce Consultants	2016;2017	Cengage Learning
Question 244 What is the RSA Secret Key Challenge?		RSA Labs FAQ 4. 0		1998	RSA Labs
Diagonalizing over deterministic polynomial time	Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig	CSL ' 87: 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings	Egon Börger; Hans Kleine Büning; Michael M. Richter	1988	Springer Berlin Heidelberg
Non-deterministic in Polynomial Time		7 Algorithm Design Paradigms	Sung-Hyuk Cha
Simple Polynomial Factoring		Nursing Entrance Exams	Alpha	2019	Alpha Books
1113 Factoring RSA Keys		Quantum Computing Fundamentals	William (Chuck) Easttom II	2021	Addison-Wesley Professional
RSA Factoring Challenge, the New		Prime numbers: the most mysterious figures in math	D G Wells	2005	Wiley
IND-CCA Public Key Schemes Equivalent to Factoring n =pq	Kaoru Kurosawa; Wakaha Ogata; Toshihiko Matsuo; Shuichi Makishima	Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Cheju Island, Korea, February 13-15, 2001. Proceedings	Kwangjo Kim	2001	Springer Berlin Heidelberg
Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA	David Chaum	Advances in Cryptology – EUROCRYPT ' 88: Workshop on the Theory and Application of Cryptographic Techniques, Davos, Switzerland, May 25-27, 1988. Proceedings	Christoph G. Günther	1988	Springer Berlin Heidelberg
A Trapdoor Permutation Equivalent to Factoring	Pascal Paillier	Public Key Cryptography: Second International Workshop on Practice and Theory in Public Key Cryptography, PKC' 99, Kamakura, Japan, March 1-3, 1999, Proceedings	Hideki Imai; Yuliang Zheng	1999	Springer Berlin Heidelberg
The RSA Cryptosystem and Factoring Integers	Douglas R. Stinson; Maura B. Paterson	Cryptography: Theory and Practice	Douglas Robert Stinson; Maura Paterson	2018	Routledge
The RSA cryptosystem and factoring integers		Cryptography: theory and practice	Douglas R. Stinson	2002	Chapman & Hall/CRC
The RSA Cryptosystem and factoring integers		Cryptography: theory and practice	Douglas R. Stinson	2006	Chapman & Hall/CRC
RSA Cryptosystem, Primality, and Factoring		Complexity Theory and Cryptology: An Introduction to Cryptocomplexity	Jörg Rothe	2005	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring" - similar Books and Chapters