| 摘要 |
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, y1)(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.
|
