| 摘要 |
<P>PROBLEM TO BE SOLVED: To hold forgery impossibility based on the principles of quantum mechanics, to hold anonymity and to reduce the volume of secret information stored in a bank. <P>SOLUTION: Random strings a(i,j),..., a(1,n), a(2,1),..., a(2,n), a(m,1),..., a(m,n) are generated, a related bit ci obtaining the EXOR of each random string a(i,1),..., a(i,n) (i=1,..., m) is inserted in each random string a(i,1),..., a(i,n), a quantized bit string |ϕ> is generated by encoding a(i,j) or ci by a base Z at b(i,j)=0 or encoding the a(i,j) or ci by a base X at b(i,j)=1 to one of four quantized states for each corresponding bit to secret random strings B<SP>(v)</SP>=(b(i,1),..., b(1,n+1), b(2,1),..., b(2,n+1),..., b(m,1),..., b(m,n+1)) of the inserted bit strings and an issue face v, and (|ϕ>,v) is expressed as cash. In the case of using the cash (|ϕ>,v), a random string D of n×m and related bits ei of each n bits of the random string D are found out, a quantized bit of |ϕ> corresponding to each of bits in the bit string D into which the related bits ei are inserted is held as it is when d(i,j) is 0 or the quantized state is converted into |ϕ'> by rotating the quantized state by 90° when the d(i,j) is 1 and payment is performed by (|ϕ'>,v). <P>COPYRIGHT: (C)2004,JPO |
