Title :
An effective defense against first party attacks in public-key algorithms
Author :
Matyas, Stephen M., Jr. ; Roginsky, Allen
Author_Institution :
IBM Corp., Research Triangle Park, NC, USA
Abstract :
This paper describes a method for assuring that user generated public and private key pairs are cryptographically strong. This assurance is achieved by limiting the number of attempts a user can make while generating the keys. Since it takes many billions of attempts to generate so-called “weak” keys, with any significant probability of success, our method precludes users from cheating. The described method has a potential positive impact on several evolving cryptographic standards, where the strength of the keys used with public key cryptography are a matter of major concern. It has no negative impact on key generation performance. The method is simple and straightforward, and it can be easily performed with just a few computational steps
Keywords :
public key cryptography; cryptographic standards; first party attack defence; key generation performance; public key cryptography; public-key algorithms; user generated private key pairs; user generated public key pairs; Data security; Entropy; Identity-based encryption; NIST; Public key; Public key cryptography; Read only memory; Space technology;
Conference_Titel :
Computer Security Applications Conference, 1999. (ACSAC '99) Proceedings. 15th Annual
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-7695-0346-2
DOI :
10.1109/CSAC.1999.816023