Methods and apparatus are disclosed for demonstrating that a public/private key pair is cryptographically strong without revealing information sufficient to compromise the private key. A key pair can be shown to be cryptographically strong by demonstrating that its modulus N is the product of two relatively large prime numbers. In addition, a key pair can be shown to be cryptographically strong by demonstrating that N is cryptographically strong against Pollard factoring attacks, Williams factoring attacks, Bach-Shallit factoring attacks, and weighted difference of squares factoring attacks.

Los métodos y los aparatos se divulgan para demostrar que un par dominante de public/private es cryptographically fuerte sin la información que revela suficiente comprometer la llave privada. Un par dominante se puede demostrar para ser cryptographically fuerte demostrando que su módulo N es el producto de dos números primeros relativamente grandes. Además, un par dominante se puede demostrar para ser cryptographically fuerte demostrando que N es cryptographically fuerte contra Pollard que descompone en factores los ataques, Williams que descompone en factores los ataques, Bach-Shallit que descompone en factores ataques, y la diferencia cargada de los cuadrados que descomponen en factores ataques.

 
Web www.patentalert.com

< Security and access management system for web-enabled and non-web-enabled applications and content on a computer network

< Efficient finite field basis conversion involving a dual basis

> Efficient finite field multiplication in normal basis

> Client/server protocol for proving authenticity

~ 00038