
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24October 26
ISBN: 081860591X
ASCII Text  x  
J. Grollmann, A.L. Selman, "Complexity Measures For PublicKey Cryptosystems," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 495503, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984.  
BibTex  x  
@article{ 10.1109/SFCS.1984.715952, author = {J. Grollmann and A.L. Selman}, title = {Complexity Measures For PublicKey Cryptosystems}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1984}, isbn = {081860591X}, pages = {495503}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715952}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Complexity Measures For PublicKey Cryptosystems SN  081860591X SP495 EP503 A1  J. Grollmann, A1  A.L. Selman, PY  1984 VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
The first part of this paper gives results about promise problems. A "promise problem" is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NPhard, and we show that a number of results and a conjecture about promise problems are equivalent to separability assertions that are the natural analogues of wellknown results in classical recursion theory. The conjecture, if it is true, implies nonexistence of PKCS having NPhard cracking problems. The second part of the paper studies more appropriate measures for PKCS. Among the results obtained are the following: Oneway functions exist if an only if P /spl ne/ U and oneway functions f such that range f /spl epsiv/ P exist if and only if U /spl cap/ coU /spl ne/ P. It will allow that there exist PKCS that cannot be cracked in polynomial time (and that satisfy other reasonable assumptions) only if P /spl ne/ U.
Citation:
J. Grollmann, A.L. Selman, "Complexity Measures For PublicKey Cryptosystems," focs, pp.495503, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.