US 8,023,647 Claim Chart
US 8,023,647(Shaik)
1.pre A method comprising:
1.a.i. submitting a user
identification for a user
1.a.ii. from a user computer to a
server computer;
1.b. receiving a set of information
at the user computer from the
server computer, in response to
the submission of the user
identification for the user;
1.c. wherein the set of
information includes a parameter
of a key; and
1.d. further comprising
1.e.i. using the user computer to
convert user confidential
information to a number x,
1.e.ii. wherein the number x is
dependent on the user confidential numerical function. See supra Claim 1.e.i.
information;
1.f. using the user computer to
compute a number e which is a
function of x and which is a
function of the user confidential
information;
1.g. using the user computer to
pad the number x to convert x to
Xp;
US 6,480,605(Uchiyama)
Describes a method identifying users using a secret key.
See 1:41-43.
Discloses that the “encryption procedure by the encryption
device 100 may be implemented by recording the
procedure as an operation program on a recording medium
and reading it out for execution by a computer.”
See 11:1-4.
See supra Claim 1.a.ii.
Discloses public and secret keys. “The encryption and
decryption processes E(M) and D(C) of a message M are
defined by the following equations using (n, e) as public
keys and (d, p, q) as Secret keys.” See 2:57-59.
Discloses an example of conversion from "plaintext" to
numerical function.
“Upon receiving a plaintext (m) from a user of the
encryption device 100, the exponent generation part 110
generates a random number r∊Z/nZ by a random generator
111, and inputs the random number r into the a multiplier
112.” See 10:36-40.
“For the plaintext m, the function h is used to obtain
M=m∥h(m), and the random number r is chosen in the
range of 0≦r<n. The ciphertext C is computed as follows:
C=gM+r n mod n.” See 12:13-18.
Discloses an example of conversion from "plaintext" to
Discloses a computed ciphertext, C as a function of the
user confidential information M. See supra Claim 1.e.i.
Discloses that “In the above-described embodiment, as will
be seen from its representation, the ciphertext is a directly
encrypted version of the plaintext m in the raw, as
PATROLL – Prior Art Crowdsourcing
http://patroll.unifiedpatents.com

1.h. using the user computer to
encrypt x p by using the parameter
of the key and the number e to
form a cipher C, wherein C is a
function of the user confidential
information; and
1.i. submitting the cipher C from
the user computer to the server
computer.
expressed by C=gM+r n mod n, and it is not proved to be
secure against passive adversaries. A description will be
given of embodiments of an encryption device which are
improved in this respect from the FIG. 1 embodiment and
can be proved to be secure against passive adversaries.”
See 11:11-17.
Further discloses that the number m, equivalent to x, is
multiplied by a random number, r, yielding a value
equivalent to X p , M, that fits within a predetermined range.
See 11:18-26. See also 12:13-15.
Discloses that “[t]he encryption and decryption processes
E(M) and D(C) of a message M are defined by the
following equations using (n, e) as public keys and (d, p, q)
as Secret keys.” See 2:57-59.
Further discloses the formation of a cypher, C. See supra
Claim 1.e.i.
Discloses the sending of the cypher from the user computer
in that “[a] ciphertext generated by the n-exponentiator is
provided onto a communication line[.]” See 8:42-43.
PATROLL – Prior Art Crowdsourcing
http://patroll.unifiedpatents.com