human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "cryptanalysis of an image block encryption algorithm based on chaotic maps"):
  Abstract: Recently, an image block encryption algorithm was proposed based on some well-known chaotic maps. The authors claim that the encryption algorithm achieves enough security level and high encryption speed at the same time. However, we find that there are some critical security defects in the algorithm. In this paper, we give a thorough security analysis on the algorithm from the perspective of modern cryptography. Given one pair of known plain-image and its corresponding cipher-image, the attacker can obtain an equivalent secret key to successfully decrypt the other cipher-images encrypted with the same secret-key. In addition, each security metric adopted in the security evaluation on the algorithm is questioned. The drawn lessons are generally applicable to many other image encryption algorithms.

Includes members:
  Member "dynamic analysis of digital chaotic maps via state mapping networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "when an attacker meets a cipher image in 2018 a year in review")
  Member "cryptanalysis of a chaotic image encryption algorithm based on information entropy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when an attacker meets a cipher image in 2018 a year in review")
  Member "cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an authentication protocol based on chaos and zero knowledge proof")
  Member "cracking a hierarchical chaotic image encryption algorithm based on permutation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "when an attacker meets a cipher image in 2018 a year in review")

Question: Please tell me which class the source paper 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)