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: "breaking a chaotic image encryption algorithm based on modulo addition and xor operation"
  Abstract: This paper re-evaluates the security of a chaotic image encryption algorithm called MCKBA/ HCKBA and finds that it can be broken efficiently with two known plain-images and the corresponding cipher-images. In addition, it is reported that a previously proposed breaking on MCKBA/HCKBA can be further improved by reducing the number of chosen plain-images from four to two. The two attacks are both based on the properties of solving a composite function involving the carry bit, which is composed of the modulo addition and the bitwise OR operations. Both rigorous theoretical analysis and detailed experimental results are provided.

Connected through hyperedge HE-1 (induced by source paper "on the cryptanalysis of fridrich s chaotic image encryption scheme"):
  with members:
    - "cracking a hierarchical chaotic image encryption algorithm based on permutation"
    - "deciphering an image cipher based on mixed transformed logistic maps"
    - "breaking a novel image encryption scheme based on improved hyperchaotic sequences"
    - "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks"

Connected through hyperedge HE-2 (induced by source paper "on the security of a class of diffusion mechanisms for image encryption"):
  with members:
    - "chosen plaintext attack of an image encryption scheme based on modified permutation diffusion structure"
    - "a chaotic image encryption scheme owning temp value feedback"
    - "local shannon entropy measure with statistical tests for image randomness"
    - "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks"
    - "on the design of perceptual mpeg video encryption algorithms"
    - "a fast image encryption scheme based on chaotic standard map"

Connected through hyperedge HE-3 (induced by source paper "chosen plaintext attack of an image encryption scheme based on modified permutation diffusion structure"):
  with members:
    - "cryptanalyzing an image encryption algorithm based on scrambling and veginere cipher"
    - "a chaotic image encryption scheme owning temp value feedback"
    - "breaking an image encryption algorithm based on chaos"
    - "a fast image encryption scheme based on chaotic standard map"

Connected through hyperedge HE-4 (induced by source paper "deciphering an image cipher based on mixed transformed logistic maps"):
  with members:
    - "cryptanalyzing image encryption using chaotic logistic map"
    - "breaking a novel image encryption scheme based on improved hyperchaotic sequences"
    - "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks"

Connected through hyperedge HE-5 (induced by source paper "breaking a novel image encryption scheme based on improved hyperchaotic sequences"):
  with members:
    - "breaking a chaotic image encryption algorithm based on perceptron model"
    - "on the security defects of an image encryption scheme"
    - "on the security of the yi tan siew chaotic cipher"

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)