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: "improving random number generators by chaotic iterations application in data hiding"
  Abstract: In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated sequences can pass all the DieHARD statistical test suite. In addition, this generator behaves chaotically, as defined by Devaney. This makes our generator suitable for cryptographic applications. An illustration in the field of data hiding is presented and the robustness of the obtained data hiding algorithm against attacks is evaluated.

Connected through hyperedge HE-1 (induced by source paper "an optimization technique on pseudorandom generators based on chaotic iterations"):
  with members:
    - "a new chaos based watermarking algorithm"
    - "class of trustworthy pseudo random number generators"
    - "topological chaos and chaotic iterations application to hash functions"
    - "a pseudo random numbers generator based on chaotic iterations application to watermarking"

Connected through hyperedge HE-2 (induced by source paper "building a chaotic proved neural network"):
  with members:
    - "hash functions using chaotic iterations"
    - "randomness quality of ci chaotic generators applications to internet security"
    - "topological chaos and chaotic iterations application to hash functions"

Connected through hyperedge HE-3 (induced by source paper "class of trustworthy pseudo random number generators"):
  with members:
    - "topological chaos and chaotic iterations application to hash functions"
    - "a pseudo random numbers generator based on chaotic iterations application to watermarking"

Connected through hyperedge HE-4 (induced by source paper "on the design of a family of ci pseudo random number generators"):
  with members:
    - "hash functions using chaotic iterations"
    - "a pseudo random numbers generator based on chaotic iterations application to watermarking"

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)