004.056.53 (003.

26)
..

The modular secret sharing scheme with consecutive moduli is constructed. The homomorphic property of modular scheme is
proved. The electronic voting scheme based on perfect and ideal modular scheme is constructed.

1979 . . [1] .
[2]. , :
,
, ,
. ,
.
,
. , , . [3]
. ,
.
.
, . , . [4] . [5]. . I = {1, 2,..., t} , . i I mi
si = c(mod mi ) c mi ,
. A I
c, .
, c < [mi , i A]. . .
c m0 ,
. [6, 7].
Fq [ x] Fq . , .
():
[8]. [6] , [7]

. ,
[9].

,
.
1. . a, a+1,,
a+t1 . (k, t)-
,
max (a + i1 ,K, a + ik 1 ) < min (a + j1 ,K, a + jk ).
(1)
j1 ,K, jk

i1 ,K,ik 1

1. a, a + 1,K , a + t 1
a + i1 , a + i2 ,K , a + is s < t .
(a + i1 )(a + i2 ) K (a + is ) (t 1) s ( s 1)/ 2 (a + i1 , a + i2 ,K , a + is ).
(2)
. :
(a + i1 ) (a + i2 ,K , a + is )
( a + i1 ) (a + i2 ,K , a + is )
( a + i1 ,K , a + is ) =

s
(a + i1 , (a + i2 ,K , a + is ))
(a + i1 , (a + i j ))
j =2
s

(a + i1 ) (a + i2 ,K , a + is )
s

(a + i ,(a + i ))
1

( a + i )
j

(a + i1 ) (a + i2 ,K , a + is )
j =1

K
.
s 1
(t 1)
(t 1) s ( s 1)/ 2

j =2

101

 . . 1. 2011. 1

, .
, a (1).
. (1), a
a e (t 1) k ( k 1)/ 2 .
(3)
. 1
(a + i1 ,K, a + is ) ( a + i1 )L (a + is ),
(2) :
(a )L (a + k 1) (t 1) k ( k 1)/ 2 (a + t 1)L (a + t k ).
(4)
, a > (t 1) k ( k 1)/ 2 . a = (t 1) k ( k 1)/ 2 .
:
k 1

k 1

k 1

(a + t 1)L (a + t k ) a + t 1
1
1

1 +
= 1 +
< e.
k ( k 1)/ 2 1
( a + 1)L (a + k 1)
a
k 1
(t 1)

, e (4) , ,
(1).
, (4) a, a+1.

X (a ) = a(a + 1)L (a + k 1), Y (a ) = (t 1) k ( k 1)/ 2 (a + t 1)(a + t 2)L (a + t k ).

X (a + 1) X (a) (a + k ) (a + t k ) X (a) k (t k ) X (a)
=

> 1.
=
1 +

Y (a + 1) Y ( a)
a (a + t )
Y (a) a(a + t ) Y (a)
.
, ,
.
2. .
() [9] 1981 .
.
.
.
/, ,

.
:
1. , ,
, .
2. ,
.
3. .
2.1 , .
[3].
.
.
S S1 ,K , St
. : 1 ,K , t .
Recover ( s1 , s2 ,K , st ) , Share (c, )
, . , ,
, (:, 1 ,K , t )- ,
c1 , c2 S
c1 : c2 =Recover( s11 1 s12 , s12 2 s22 ,K , st1 t st2 ),
( s , s ,K , s ) = Share (c1 , ), ( s , s ,K , s ) = Share (c2 , ).
1
1

102

1
2

1
t

2
1

2
2

2
t

(5)

S1 = S 2 = K = St = Sshares 1 = K = t = , (:, 1 ,K , t )-
(:, )- .

. , .
2.
Fq (+,+).
. ,
:
c1 ( x) = C1 ( x)(mod m0 ( x)),
c2 ( x) = C2 ( x)(mod m0 ( x)).
C1 , C2 , c1 c2 .
c1 ( x) + c2 ( x) = C1 ( x) + C2 ( x)(mod m0 ( x)).
, C1 ( x) + C2 ( x)
si1 ( x) + si2 ( x). ,
. . .
V1 ,K ,Vm ,
A1 ,K , At . A,
. vyes vno

. [3],
:
1. ()
( )
(+, + )- .
2. .
(+, + )-
, , , .
3. ,
, .
2.2. .

. ,
t ,
(m1 ( x),K , mt ( x)) (m0 ( x), m1 ( x),K , mt ( x)).
V1 ,K ,Vm , A1 ,K, At
.

1. A (k , t )-
,
(m0 ( x), m1 ( x),K, mt ( x)) n.
2. A vyes vno , vyes , vno Fq [ x]
, deg vyes ( x) < n, deg vno ( x) < n.

1. V j b j ( x) Fq [ x], 0 < deg b j ( x) < n,
v j ( x) {vyes ( x), vno ( x)} B j ( x) = v j ( x) + b j ( x).

p j ( x) Fq [ x],

deg p j ( x) < (k 1)n,

CB j ( x) = p( x)m0 ( x) + B j ( x).
103

 . . 1. 2011. 1

2. V j

B j i ( x) = CB j ( x)(mod mi ( x))

Ai 1 j m 1 i t.

1.

Ai

Ti ( x) = j =1B j i ( x)(mod mi ( x)) A

m

1 i t.
2.

T ( x) = j =1B j ( x), :
m

C ( x) Ti ( x)(mod mi ( x)), i D,
D, T ( x) = C ( x)(mod m0 ( x)).
(+ m , + m ,K, + m )- , T1 ( x),K, Tt ( x)
0

T ( x).

V j , 1 j m,
b j ( x) A.

1. A
R ( x) = j =1v j ( x) R ( x) = T ( x) j =1b j ( x).
m

2.
vyes ( x) z + vno ( x) y = R( x). vyes ( x) vno ( x) , deg vyes ( x) < deg vno ( x),
: tno = adeg R ( x ) , adeg R ( x )

R ( x),

t yes = a%deg P ( x ) ,

a%deg P ( x )

P ( x) = R( x) tno vno ( x). , q , q > m.

A (t yes , tno ).
: .
,
, .
1. B l a k l e y G . // Proc. AFIPS nat. comp. conf. New York, 1979. Vol. 48. P. 313.
2. S h a m i r A . // Comm. of the ACM. 1979. Vol. 22. P. 612.
3. B e n a l o h J . // LNCS. 1987. Vol. 263. P. 251.
4. A s m u t h C . , B l o o m J . // IEEE Transactions on Information Theory. 1983. Vol. 29. P. 156.
5. M i g n o t t e M . // Advances in cryptology Eurocrypt82, LNCS. 1982. P. 371.
6. G a l i b u s T . , M a t v e e v G . , S h e n e t s N . // SYNASC'2008: 10th International Symposium on Symbolic and Numeric
Algorithms for Scientific Computing, IEEE Comp. Soc., CPS / Ed. by V. Negru et al. Los Alamitos, 2009. P. 197.
7. . . // . . . .-. . 2010. . 54. 6. . 9.
8. S t i n s o n D . R . Cryptography: theory and practice. 2-nd ed. New York, 2002.
9. Q u i s q u a t e r M . , P r e n e e l B . , V a n d e w a l l e J . // LNCS. 2002. Vol. 2274. P. 199.
23.12.10.

104