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 "breaking a chaotic cryptographic scheme based on composition maps"):
  Abstract: Recently a chaotic cryptographic scheme based on composition maps was proposed. This paper studies the security of the scheme and reports the following problems: (1) the scheme can be broken by a differential attack with 6 + ⌈logL(MN)⌉ chosen plaintexts, where MN is the size of the plaintext and L is the number of different elements in plaintext; (2)the two composition maps both do not work as a secure and efficient source of random numbers; (3)the scheme is not sensitive to the changes of the plaintext.

Includes members:
  Member "on the security defects of an image encryption scheme":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an optical image encryption scheme based on depth conversion integral imaging and chaotic maps")
  Member "a general quantitative cryptanalysis of permutation only multimedia ciphers against plaintext attacks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cryptanalyzing a medical privacy protection scheme based on dna coding and chaos")
  Member "security analysis of a chaos based image encryption algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a differential cryptanalysis of yen chen wu multimedia cryptography system mcs")
  Member "on the security of the yen guo s domino signal encryption algorithm dsea":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking a chaotic image encryption algorithm based on modulo addition and xor operation")
  Member "on the security of the yi tan siew chaotic cipher":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "breaking a chaotic image encryption algorithm based on modulo addition and xor operation")

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)