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 modified substitution diffusion image cipher based on chaotic standard and logistic maps"
  Abstract: Recently, an image encryption scheme based on chaotic standard and logistic maps was proposed by Patidar et al. It was later reported by Rhouma et al. that an equivalent secret key can be reconstructed with only one known/chosen-plaintext and the corresponding ciphertext. Patidar et al. soon modified the original scheme and claimed that the modified scheme is secure against Rhouma et al.'s attack. In this paper, we point out that the modified scheme is still insecure against the same known/chosen-plaintext attack. In addition, some other security defects existing in both the original and the modified schemes are also reported.

Connected through hyperedge HE-1 (induced by source paper "cryptanalyzing image encryption using chaotic logistic map"):
  with members:
    - "breaking a chaotic image encryption algorithm based on perceptron model"
    - "on the security defects of an image encryption scheme"
    - "cryptanalysis of an image encryption scheme based on a compound chaotic sequence"

Connected through hyperedge HE-2 (induced by source paper "a chaotic image encryption scheme owning temp value feedback"):
  with members:
    - "breaking a novel colour image encryption algorithm based on chaos"
    - "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks"

Connected through hyperedge HE-3 (induced by source paper "breaking an image encryption algorithm based on chaos"):
  with members:
    - "on the security defects of an image encryption scheme"
    - "cryptanalysis of an image encryption scheme based on a compound chaotic sequence"
    - "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks"

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)