human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a revision of a new chaos based image encryption system weaknesses and limitations"
  Abstract: Lately, multimedia encryption has been the focus of attention in many researches. Recently, a large number of encryption algorithms has been presented to protect image contents.The main objective of modern image encryption schemes is to reduce the computation complexity in order to respond to the real time multimedia and/or limited resources requirements without degrading the high level of security. In fact, most of the recent solutions are based on the chaotic theory. However, the majority of chaotic systems suffers from different limitations and their implementation is difficult at the hardware level because of the non integer operations that are employed requiring huge resources and latency. In this paper, we analyze the new chaos-based image encryption system presented in~\cite{el2016new}. It uses a static binary diffusion layer, followed by a key dependent bit-permutation layer that only iterates for one round. Based on their results in this paper, we claim that the uniformity and avalanche effect can be reached from the first round. However, we tried to verify the results but our conclusion was that these results were wrong because it was shown that at least 6 iterations are necessary to ensure the required cryptographic performance such as the plain-sensitivity property. Therefore, the required execution time must be multiplied by 6 and consequently this will increase the latency. In addition to all aforementioned problems, we find that ensuring the avalanche effect in the whole image introduces a high error propagation. In order to solve this problem, we recommend to ensure the avalanche effect in the level of blocks instead of the whole image.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)