No abstract

Boolean functions play an important role in the design of stream ciphers. In this paper, a simulated annealing algorithm is designed to obtain Boolean functions satisfying all the needed criteria: high nonlinearity, 1-resiliency, optimal algebraic degree, optimal (or suboptimal) algebraic immunity, and good immunity to fast algebraic attacks. These functions provide a good trade-off among the criteria to resist the known cryptanalytic techniques.

Cheating prevention is an important cryptographic problem in secret-sharing schemes. In this paper, two constructions of 1-cheating immune secret-sharing functions are presented. Then a method for constructing new 1-cheating immune secret-sharing functions from known ones is given.