In this paper we study linear secret sharing schemes by monotone span programs, according to the relation between realizing access structures by linear secret sharing schemes and computing monotone Boolean functions b...In this paper we study linear secret sharing schemes by monotone span programs, according to the relation between realizing access structures by linear secret sharing schemes and computing monotone Boolean functions by monotone span programs. We construct some linear secret sharing schemes. Furthermore, we study the rearrangements of access structures that is very important in practice.展开更多
Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diopha...Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diophantine equations.展开更多
文摘In this paper we study linear secret sharing schemes by monotone span programs, according to the relation between realizing access structures by linear secret sharing schemes and computing monotone Boolean functions by monotone span programs. We construct some linear secret sharing schemes. Furthermore, we study the rearrangements of access structures that is very important in practice.
文摘Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diophantine equations.
