US 7,548,618 B2 · Converter, encryption/decryption system, multi-stage converter, converting method, multi-stage converting method, program, and information recording medium

Abstract

A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1(x1, a) and yi+1=Fi+1(xi+1, yi) (1≦i≦n−1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m≧0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di⋆ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.

Drawings

Drawings are temporarily unavailable. Open the PDF at USPTO

Drawings

Claims10

Dependent claims

A computer readable medium having stored thereon a converter using:

an “n” (n≧1) number of conversion functions, F1, F2, . . . , Fn:
A×A→A, with respect to a domain A;
a binary exclusive OR operator, XOR:
A×A→A;
and
a predetermined parameter, aεA, and
said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xnεA, and generating generative outputs, y1, y2, . . . , ynεA, using recurrence formulas,
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,xi) (for 1≦i≦n−1);
a key accepting unit accepting key inputs, k1, k2, . . . , knεA, and giving the accepted key inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rnεA;
a data accepting unit accepting data inputs, d1, d2, . . . , dnεA;
and
a converting unit converting the data inputs into data outputs, e1, e2, . . . , enεA using a formula
ei=di XOR ri (1≦i≦n), and
outputting the data outputs;
and
wherein at least one of the conversion functions, F1, F2, . . . Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and
wherein the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function, ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q)
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−M−s).

26 more elements

A computer readable medium having stored thereon a converter using:

an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A, wherein, for arbitrary xεA and yεA, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, ⋆:
An→An, and its reverse unary arithmetic operation, ⊚:
A×A→A, wherein, for arbitrary zεAn, conditions of
⋆(⊚z)=z, and
⊚(⋆z)=z
are satisfied;
and
a predetermined parameter, aεA, and
said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xnεA, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , ynεA, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , knεA, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rnεA;
a converting unit applying the unary arithmetic operation, ⋆, to the random number string, r1, r2, . . . , rnεA, to perform its data conversion,
(e1,e2, . . . ,en)=⋆(r1,r2, . . . ,rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms).

31 more elements

A computer readable medium having stored thereon a converter using:

an “n” (n≧1) number of conversion functions, F1, F2, . . . , Fn:
A×A→A, and their inverse conversion functions, G1, G2, . . . , Gn:
A×A→A, with respect to a domain A, wherein, for arbitrary xεA and yεA, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, ⋆:
An→An, and its reverse unary arithmetic operation, ⊚:
A×A→A, wherein, for arbitrary zεAn, conditions of
⋆(⊚z)=z, and
⊚(⋆z)=z
are satisfied;
and
a predetermined parameter, aεA, and
the converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xnεA, and generating generative outputs, y1, y2, . . . , ynεA using recurrence formulas,
y1=G1(x1,a), and
yi+1=Gi+1(xi+1,xi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, h1, h2, . . . , hnεA, whose length is “n” in total and giving the accepted data inputs as generative inputs to said generating unit;
a converting unit applying the unary arithmetic operation, ⋆, to the random number string, r1, r2, . . . , rnεA, to perform its data conversion,
(v1, v2, . . . , vn)=⋆(h1, h2, . . . , hn), and giving results of the data conversion, v1, v2, . . . , vn, to said generating unit;
and
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rnεA, and
wherein,
at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function, ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms).

31 more elements

A computer readable medium having stored thereon an encryption/decryption system comprising:

a converter as an encrypting unit using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is
“n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and
“M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a converter as a decrypting unit using:
an “n” (n≧1) number of conversion functions, F1, F2, . . . , Fn:
A×A→A, and their inverse conversion functions, G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and the converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, and generating generative outputs, y1, y2, . . . , yn A using recurrence formulas,
y1=G1(x1,a), and
yi+1=Gi+1(xi+1,xi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, h1, h2, . . . , hn A, whose length is “n” in total and giving the accepted data inputs as generative inputs to said generating unit;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (v1, v2, . . . , vn)=(h1, h2, . . . , hn), and giving results of the data conversion, v1, v2, . . . , vn, to said generating unit;
and
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A, and
wherein,
at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function, ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms),
wherein:
“F1”, “F2”, . . . , “Fn”, “G1”, “G2”, . . . , “Gn”, “ “, “ ”, and “a”, are commonly used by said encrypting unit and said decrypting unit;
said encrypting unit accepts original data as the data inputs, k1, k2, . . . , kn, and outputs the data outputs, e1, e2, . . . , en as encrypted data;
and
said decrypting unit accepts the encrypted data as the data inputs, h1, h2, . . . , hn, and outputs the data outputs, s1, s2, . . . , sn, whose length is “n” in total as decrypted data.

69 more elements

A computer readable medium having stored thereon an encryption/decryption system comprising:

a converter as an encrypting unit using:
an “n” (n≧1) number of conversion functions, F1, F2, . . . , Fn:
A×A→A, and their inverse conversion functions, G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and the converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, and generating generative outputs, y1, y2, . . . , yn A using recurrence formulas,
y1=G1(x1,a), and
yi+1=Gi+1(xi+1,xi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, h1, h2, . . . , hn A, whose length is “n” in total and giving the accepted data inputs as generative inputs to said generating unit;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (v1, v2, . . . , vn)=(h1, h2, . . . , hn), and giving results of the data conversion, v1, v2, . . . , vn, to said generating unit;
and
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A, and
wherein,
at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b)+1 for b<x≦Ms),
and the inverse function, ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a converter as a decrypting unit using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b)+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms),
wherein:
“F1”, “F2”, . . . , “Fn”, “G1”, “G2”, . . . , “Gn”, “ “, “ ”, and “a” are commonly used by said encrypting unit and said decrypting unit;
said encrypting unit accepts original data as the data inputs, h1, h2, . . . , hn, and outputs the data outputs, s1, s2, . . . , sn, as encrypted data, and said decrypting unit accepts the encrypted data as the data inputs, k1, k2, . . . , kn, and outputs the data outputs, e1, e2, . . . , en as decrypted data.

65 more elements

A computer readable medium having stored thereon an encryption/decryption system comprising:

a multi-stage converter as an encrypting unit comprising:
a “u” number of converters M1, M2, . . . , Mu, using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b)+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a multi-stage key-input accepting unit which accepts parameter inputs a1, a2, . . . , au A, and sets the “j”-th parameter input, aj, included in the accepted parameter inputs, as the predetermined parameter “a” of the converter Mj,
wherein:
a converter M1 included in said “u” number of converters accepts multi-stage conversion inputs, k1, k2, . . . , kn as the data inputs, the data outputs, which are output by the converter Mi (1≦i≦u−1) included in said “u” number of converters, are given to the converter Mi+1 included in said “u” number of converters, as the data inputs, and a converter Mu, included in said “u” number of converters outputs the data outputs, e1, e2, . . . , en, as multi-stage conversion outputs;
and a multi-stage converter as a decrypting unit comprising:
a “u” number of converters, M1, M2, . . . , Mu, using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and
“M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b))+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a multi-stage key-input accepting unit which accepts parameter inputs a1, a2, . . . , au A, and sets the “j”-th parameter input, aj, included in the accepted parameter inputs, as the predetermined parameter “a” of the converter Mj,
wherein:
a converter Mu, included in said “u” number of converters accepts multi-stage conversion inputs, h1, h2, . . . , hn as the data inputs, data outputs, which are output by the converter Mi+1 (1≦i≦u−1) included in said “u” number of converters, are given to the converter Mi included in said “u” number of converters, as the data inputs, and a converter M1 included in said “u” number of converters outputs data outputs, s1, s2, . . . , sn as multi-stage conversion outputs,
wherein:
“F1”, “F2”, . . . , “Fn”, “G1”, “G2”, . . . , “Gn”, “ ”, and “ ”, are commonly used by said encrypting unit and said decrypting unit, parameter inputs, a1, a2, . . . , au A, are commonly accepted by said encrypting unit and said decrypting unit, said encrypting unit accepts original data as the multi-stage conversion inputs, k1, k2, . . . , kn, and outputs the multi-stage conversion outputs, e1, e2, . . . , en, as encrypted data, and said decrypting unit accepts the encrypted data as the multi-stage conversion inputs, h1, h2, . . . , hn, and outputs the data outputs, s1, s2, . . . , sn, as decrypted data.

74 more elements

A computer readable medium having stored thereon an encryption/decryption system comprising:

a multi-stage converter as an encrypting unit comprising:
a “u” number of converters M1, M2, . . . , Mu, using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and “M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b)+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a multi-stage key-input accepting unit which accepts parameter inputs a1, a2, . . . , au A, and sets the “j”-th parameter input, aj, included in the accepted parameter inputs, as the predetermined parameter “a” of the converter Mj,
wherein:
a converter M1 included in said “u” number of converters accepts multi-stage conversion inputs, k1, k2, . . . , kn as the data inputs, the data outputs, which are output by the converter Mi (1≦i≦u−1) included in said “u” number of converters, are given to the converter Mi+1 included in said “u” number of converters, as the data inputs, and a converter Mu, included in said “u” number of converters outputs the data outputs, e1, e2, . . . , en, as multi-stage conversion outputs;
and
a multi-stage converter as a decrypting unit comprising:
a “u” number of converters, M1, M2, . . . , Mu, using:
an “n” (n≧1) number of conversion functions F1, F2, . . . , Fn:
A×A→A and their inverse conversion functions G1, G2, . . . , Gn:
A×A→A, with respect to a domain A,
wherein, for arbitrary x A and y A, conditions of
Fi(Gi(x,y),y)=x, and
Gi(Fi(x,y),y)=x
are satisfied;
a unary arithmetic operation, :An→An, and its reverse unary arithmetic operation, :A×A→A, wherein, for arbitrary z An, conditions of
(z)=z, and
(z)=z
are satisfied;
and
a predetermined parameter, a A, and said converter comprising:
a generating unit accepting generative inputs, x1, x2, . . . , xn A, whose length is “n” in total, and generating generative outputs, y1, y2, . . . , yn A, using recurrence formulas
y1=F1(x1,a), and
yi+1=Fi+1(xi+1,yi) (for 1≦i≦n−1);
a data accepting unit accepting data inputs, k1, k2, . . . , kn A, and giving the accepted data inputs as generative inputs to said generating unit;
a repetition controller giving the generative outputs from said generating unit as generative inputs to said generating unit, for an “m” (m≧0) number of times, and setting the last generative outputs as a random number sequence, r1, r2, . . . , rn A;
a converting unit applying the unary arithmetic operation, , to the random number string, r1, r2, . . . , rn A, to perform its data conversion, (e1, e2, . . . , en)=(r1, r2, . . . , rn);
and
outputting data outputs, e1, e2, . . . , en,
wherein at least one of the conversion functions, F1, F2, . . . , Fn, is either a function, ma(•,•), or an inverse function of ma(•,•), ma−1(•,•), and the function, ma(•,•), is defined, by positive integers M, s, “M”-number system rounding up function, ceil(•), and
“M”-number system rounding down function, floor(•), as:
ma(x,b)=ceil(xMs/b) (for 1≦x≦b), and
ma(x,b)=floor(Ms(x−b)/(Ms−b)+1 (for b<x≦Ms),
and the inverse function ma−1(•,•), is defined as:
ma−1(y,b)=x1 (for q<x1), and
ma−1(y,b)=x2 (for x1≦q),
where
x1=floor(M−sby),
x2=ceil((M−sb−1)y+Ms), and
q=b(x2−Ms)/(b−Ms);
and
a multi-stage key-input accepting unit which accepts parameter inputs a1, a2, . . . , au A, and sets the “j”-th parameter input, aj, included in the accepted parameter inputs, as the predetermined parameter “a” of the converter Mj,
wherein:
a converter Mu, included in said “u” number of converters accepts multi-stage conversion inputs, h1, h2, . . . , hn as the data inputs, data outputs, which are output by the converter Mi+1 (1≦i≦u−1) included in said
“u” number of converters, are given to the converter Mi included in said “u” number of converters, as the data inputs, and
a converter M1 included in said “u” number of converters outputs data outputs, s1, s2, . . . , sn as multi-stage conversion outputs,
wherein:
“F1”, “F2”, . . . , “Fn”, “G1”, “G2”, . . . , “Gn”, “ “, and “ ”, are commonly used by said encrypting unit and said decrypting unit, parameter inputs, a1, a2, . . . , au, are commonly accepted by said encrypting unit and said decrypting unit,
said encrypting unit accepts original data as multi-stage conversion inputs, h1, h2, . . . , hn, and outputs the multi-stage conversion outputs, s1, s2, . . . , sn, as encrypted data, and
said decrypting unit accepts the encrypted data as the multistage conversion inputs, k1, k2, . . . , kn, and outputs the data outputs, e1, e2, . . . , en as decrypted data.

79 more elements

Dependencies are inferred from the claim text.

Description10,434 words

Summary5,092 words

#1. Field of the Invention

#The present invention relates to a converter, an encryption/decryption system, a multi-stage converter, a converting method, a multi-stage converting method, a program and an information recording medium recording information, which are preferable for a vector-stream private key encryption system.

#2. Description of the Related Art

Brief description of the drawings17 figures

#The object and other objects and advantages of the present invention will become more apparent upon reading of the following detailed description and the accompanying drawings in which:

#FIG. 1 is an exemplary diagram showing the schematic structure of a converter according to the first embodiment of the present invention;

#FIG. 2 is a flowchart showing procedures of a conversion process which is carried out by a serial computer serving as the converter;

Detailed description4,886 words

#Preferred embodiments for practicing the present invention will now be described. Embodiments, as will be explained later, are to illustrate the present invention, not to limit the scope of the present invention. For those skilled in the art, the present invention may be applicable to embodiments including replaced elements equivalent to each or entire elements of the present invention, and such embodiments are, therefore, within the scope of the present invention.

#In the explanations below, a converter which can be adopted for an encryption system using a vector-stream private (secret) key will be described in each of the first and second embodiments of the present invention, and an encryption/decryption system using either encryption system of the first and second embodiments will be described in the third embodiment of the present invention.

#In the preferred embodiments of the present invention, with respect to a domain A, there are an “n” (n≧1) number of conversion function(s) Fi: A×A→A (1≦i≦n), a binary arithmetic operation ⋆: A×A→A, and its reverse binary arithmetic operation ⊚: A×A→A. In this case, for arbitrary xεA and yεA, the conditions of: (x⋆y) ⊚y=x; and (x⊚y) ⋆y=x should be satisfied.

Facts

Application

10/233,119Filed 29 Aug 2002

Priority

JP 2001-26169830 Aug 2001

Published

US 2003/0044008 A16 Mar 2003

Granted

16 Jun 2009

Term ended

19 Sep 2024

Estimated · how

20 years from earliest known nonprovisional domestic filing plus recorded patent term adjustment, including 752 days of adjustment. Maintenance-fee lapses, terminal disclaimers and statutory extensions have not been checked. The continuity chain may be incomplete; this is not an enforceability determination.

Classification3 codes

H04L 9/065
The encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions;…
H04L 2209/125
Details relating to cryptographic hardware or logic circuitry: parallelization or pipelining, e.g. for accelerating processing of cryptographic…
H04L
Digital communication

Timeline

30 Aug 2001Priority claimedJP 2001-261698
29 Aug 2002Application filedUS 10/233,119
29 Aug 2002Assigned to Communications Research Laboratoryassignment of assignor's interest
6 Mar 2003PublishedUS 2003/0044008 A1
18 Aug 2005Assigned to National Institute of Information and Communications Technology Incorporated Administrative Agencychange of name
16 Jun 2009GrantedUS 7,548,618 B2
19 Sep 2024Term endedEstimated, includes 752 days of adjustment

Converter, encryption/decryption system, multi-stage converter, converting method, multi-stage converting method, program, and information recording medium

Life of this patent

Converter, encryption/decryption system, multi-stage converter, converting method, multi-stage converting method, program, and information recording medium

Life of this patent

Life of this patent

Abstract

Drawings

Drawings

Claims10

Description10,434 words

Drawings

Classification3 codes

Life of this patent

Description10,434 words