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: "class of trustworthy pseudo random number generators"
  Abstract: With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information hiding schemes. One of the existing chaos-based PRNGs is using chaotic iterations schemes. In prior literature, the iterate function is just the vectorial boolean negation. In this paper, we propose a method using Graph with strongly connected components as a selection criterion for chaotic iterate function. In order to face the challenge of using the proposed chaotic iterate functions in PRNG, these PRNGs are subjected to a statistical battery of tests, which is the well-known NIST in the area of cryptography.

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"
    - "topological chaos and chaotic iterations application to hash functions"
    - "improving random number generators by chaotic iterations application in data hiding"
    - "a pseudo random numbers generator based on chaotic iterations application to watermarking"

Connected through hyperedge HE-2 (induced by source paper "application of steganography for anonymity through the internet"):
  with members:
    - "steganography a class of secure and robust algorithms"
    - "a complexity approach for steganalysis"
    - "chaotic iterations versus spread spectrum chaos and stego security"

Connected through hyperedge HE-3 (induced by source paper "the metadata anonymization toolkit"):
  with members:
    - "evaluating quality of chaotic pseudo random generators application to information hiding"

Connected through hyperedge HE-4 (induced by source paper "steganography a class of algorithms having secure properties"):
  with members:
    - "chaotic iterations versus spread spectrum chaos and stego security"

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)