Password self encryption method and system and encryption by keys generated from personal secret information

• US 7,522,723 B1
• Filed: 07/10/2008
• Issued: 04/21/2009
• Est. Priority Date: 05/29/2008
• Status: Expired due to Fees

• Current Assignee: Cheman Shaik
• Original Assignee: Cheman Shaik
• Inventors: Shaik, Cheman
• Primary Examiner(s): Cervetti, David Garcia
• Application Number:
  US12/170,506
• Time in Patent Office: 285 Days
• Field of Search: 713/183, 713/184, 726/5, 380/30, 380/282
• US Class Current: 380/30
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 9/002 Countermeasures against attacks on cryptographic mechanisms network architectures or network communication protocols for protection against malicious traffic H04L63/1441
• CPC Class Codes: H04L 9/0844 with user authentication or key authentication, e.g. ElGamal, MTI, MQV-Menezes-Qu-Vanstone protocol or Diffie-Hellman protocols using implicitly-certified keys
• CPC Class Codes: H04L 9/302 involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes

Abstract

A public key cryptographic system and method is provided for a password or any other predefined personal secret information that defeats key factoring and spoofing attacks. The method adopts a new technique of encrypting a password or any predefined secret information by a numeric function of itself, replacing the fixed public key of the conventional RSA encryption. The whole process involving key generation, encryption, decryption and password handling is discussed in detail. Mathematical and cryptanalytical proofs of defeating factoring and spoofing attacks are furnished.

Claims

1. A method comprising

converting a first set of predefined information on a server computer to an integer x using a text to number conversion scheme;

determining a first public key exponent e which is computed as any function of x that results in an odd integer for e;

selecting two prime numbers p and q, wherein p−

1 and q−

1 are relatively primes to e, and then computing a first key modulus n=p times q and a Euler Totient Function ø

=(p−

1)(q−

1);

computing a first private key exponent d such that ed=kø

+1, wherein k and d are integers

storing the first private key exponent d and the first key modulus n in a database or file on the server computer, so that the first private key exponent d and the first key modulus n are related to a first user identification of a first user and the first set of predefined information; and

permanently deleting x, p, q, e and ø

on the server computer so that there is no record of x, p, q, e and ø

on the server computer.

2. The method of claim 1 further comprising

repeating the steps of claim 1 for a plurality of sets of predefined information on the server computer, to determine a plurality of public key exponents, a plurality of key moduluses, a plurality of private key exponents, and storing a plurality of private key exponents and a plurality of key moduluses in the database or file related to a plurality of user identifications of a corresponding plurality of users and a plurality of sets of predefined information.

3. The method of claim 2 further comprising

submitting the first user identification by a user at a client computer, without the first set of predefined information, to the server computer while retaining the first set of predefined information on the client computer, when a user at a client computer enters both a user identification and a set of predefined information for authentication;

and

retrieving the first key modulus n from the database or file on the server computer for the received user identification and sending the first key modulus n to a client computer for encrypting the first set of predefined information.

4. The method of claim 3 further comprising

converting the first set of predefined information entered on the client computer to the same integer x by the same text-to-number conversion scheme as done on the server computer;

computing the first public key exponent e on the client computer using the same function of x used on the server computer;

padding the first set of predefined information to form a padded first set predefined of information;

converting the padded first set of predefined information to an integer x_p using a text-to-number conversion scheme;

encrypting x_p to produce cipher C=x_p^e mod n; and

submitting the first user identification and cipher of the first set of predefined information to server computer.

5. The method of claim 4 further comprising

decrypting cipher C to number x_p, by x_p=C^d mod n on the server computer;

converting the number x_p back to the padded first set of predefined information by reverse conversion and subsequently obtaining the first set of predefined information by removing padding.

6. The method of claim 1 wherein

the first set of predefined information includes a password.

7. The method of claim 6 further comprising

encrypting a second set of undefined information with a public key generated using the password once a user logs into a web application.

8. The method of claim 6 further comprising

using the password as a digital certificate of a user and digitally signing messages using a public key generated from the password.

9. The method of claim 6 further comprising

decrypting messages from the server computer to the client computer using the public key generated from the password in order to secure information in both directions.

10. The method of claim 6 further comprising

encrypting message digest by using the public key generated from the password.

11. The method of claim 1 wherein

the first set of predefined information includes a pass phrase or credit card information or any individual identity information.

12. The method of claim 1 wherein

the steps of claim 1 are implemented using a layer underlying communication between the client computer and the server computer.

13. The method of claim 12 wherein

the layer includes a web browser.

14. The method of claim 12 wherein

the layer includes a web page.

15. The method of claim 1 wherein

the server computer is comprised of a plurality of computers.

16. The method of claim 1 wherein

the public key exponent e is computed from the equation e=ix±

1, wherein i is any even number that can be changed from user to user.

17. The method of claim 1 further comprising

entering the first user identification and the first set of predefined information in a single web page on a first user computer;

submitting the first user identification from the first user computer to the server computer, without the first set of predefined information; and

subsequently receiving the first key modulus n at the first user computer, from the server computer, and then submitting the cipher of first set of predefined information from the first user computer to the server computer.

18. The method of claim 1 further comprising

entering the first user identification in a first web page on a first user computer;

submitting the first user identification from the first user computer to the server computer, without the first set of predefined information;

subsequently receiving the first key modulus n at the first user computer, from the server computer;

entering the first set of predefined information in a second web page on the first user computer after the first key modulus n has been received at the first user computer;

and submitting a cipher of the first set of predefined information to the server computer.