Role-based access control (RBAC) model has been widely recognized as an efficient access control model and becomes a hot research topic of information security at present. However, in the large-scale enterprise application environments, the traditional RBAC model based on the role hierarchy has the following deficiencies: Firstly, it is unable to reflect the role relationships in complicated cases effectively, which does not accord with practical applications. Secondly, the senior role unconditionally inherits all permissions of the junior role, thus if a user is under the supervisor role, he may accumulate all permissions, and this easily causes the abuse of permission and violates the least privilege principle, which is one of the main security principles. To deal with these problems, we, after analyzing permission types and role relationships, proposed the concept of atom role and built an atom-role-based access control model, called ATRBAC, by dividing the permission set of each regular role based on inheritance path relationships. Through the application-specific analysis, this model can well meet the access control requirements.

Rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used in many different cryptosystems. This paper presents a new construction of balanced odd-variable rotation symmetric Boolean functions with optimum algebraic immunity. It is checked that, at least for some small variables, such functions have very good behavior against fast algebraic attacks. Compared with some known rotation symmetric Boolean functions with optimum algebraic immunity, the new construction has really better nonlinearity. Further, the algebraic degree of the constructed functions is also high enough.

In CRYPTO 2019, Gohr first introduced the deep learning method to cryptanalysis for SPECK32/64. A differential-neural distinguisher was obtained using ResNet neural network. Zhang et al. used multiple parallel convolutional layers with different kernel sizes to capture information from multiple dimensions, thus improving the accuracy or obtaining a more round of distinguisher for SPECK32/64 and SIMON32/64. Inspired by Zhang's work, we apply the network structure to other ciphers. We not only improve the accuracy of the distinguisher, but also increase the number of rounds of the distinguisher, that is, distinguish more rounds of ciphertext and random number for DES, Chaskey and PRESENT.

In recent years, algebraic attacks and fast algebraic attacks have received a lot of attention in the cryptographic community. There are three Boolean functions achieving optimal algebraic immunity based on primitive element of F2n. The support of Boolean functions in [1]-[3] have the same parameter s, which makes us have a large number of Boolean functions with good properties. However, we prove that the Boolean functions are affine equivalence when s takes different values.