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 a chaotic image encryption algorithm based on information entropy"):
  Abstract: Recently, a chaotic image encryption algorithm based on information entropy (IEAIE) was proposed. This paper scrutinizes the security properties of the algorithm and evaluates the validity of the used quantifiable security metrics. When the round number is only one, the equivalent secret key of every basic operation of IEAIE can be recovered with a differential attack separately. Some common insecurity problems in the field of chaotic image encryption are found in IEAIE, e.g., the short orbits of the digital chaotic system and the invalid sensitivity mechanism built on information entropy of the plain image. Even worse, each security metric is questionable, which undermines the security credibility of IEAIE. Hence, IEAIE can only serve as a counterexample for illustrating common pitfalls in designing secure communication method for image data.

Includes members:
  Member "cryptanalyzing an image scrambling encryption algorithm of pixel bits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an efficient image encryption scheme based on ordered quasi resonant rossby drift wave triads and mordell elliptic curves")
  Member "on the cryptanalysis of fridrich s chaotic image encryption scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an efficient image encryption scheme based on ordered quasi resonant rossby drift wave triads and mordell elliptic curves")
  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")
  Member "cryptanalyzing image encryption using chaotic logistic map":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cryptanalysis of a chaos based fast image encryption algorithm for embedded systems")
  Member "dynamic analysis of chaotic maps as complex networks in the digital domain":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography")
  Member "network analysis of the state space of chaotic map in digital domain":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography")
  Member "entropy and set cardinality inequalities for partition determined functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")

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)