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: "a pseudo random numbers generator based on chaotic iterations application to watermarking"
  Abstract: In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.

Connected through hyperedge HE-1 (induced by source paper "efficient and secure substitution box and random number generators over mordell elliptic curves"):
  with members:
    - "efficient construction of s boxes based on a mordell elliptic curve over a finite field"

Connected through hyperedge HE-2 (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"
    - "improving random number generators by chaotic iterations application in data hiding"

Connected through hyperedge HE-3 (induced by source paper "low cost monitoring and intruders detection using wireless video sensor networks"):
  with members:
    - "hash functions using chaotic iterations"
    - "topological chaos and chaotic iterations application to hash functions"
    - "chaotic iterations versus spread spectrum chaos and stego security"

Connected through hyperedge HE-4 (induced by source paper "class of trustworthy pseudo random number generators"):
  with members:
    - "topological chaos and chaotic iterations application to hash functions"
    - "improving random number generators by chaotic iterations application in data hiding"

Connected through hyperedge HE-5 (induced by source paper "on the design of a family of ci pseudo random number generators"):
  with members:
    - "hash functions using chaotic iterations"
    - "improving random number generators by chaotic iterations application in data hiding"

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)