| 摘要 |
PROBLEM TO BE SOLVED: To reduce cost of a string of an encrypted text in which ((s, ps, ps, ..., ps, ..., s, ps, ps, ..., ps) of Z) is resoled into p.SOLUTION: When p is a natural number of 2 or more, n is a natural number of 1 or more, m is a natural number of 2 or more, i=0, ..., m-1, j=0, ..., n-1; k=0, ..., m-1, and q=p, a first encrypted-text &phgr; [j, k]=E (<s>) which is encrypted separation value (<s>) of Z) is obtained on a member s=<s>+p<s>+ ... +p<s>of a set ((s, ps, ps, ..., ps, ..., s, ps, ps, ..., ps) of Z). The first encrypted text &phgr; [j, k-i] on j=0, ..., n-1 and k=0, ..., m-1 is outputted as an encrypted text of <ps>which satisfies k≥i. |
