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 "fpga design for pseudorandom number generator based on chaotic iteration used in information hiding application"):
  Abstract: Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable fixed-point method for random streams generation. In our previous researches, we have proposed a technique by applying some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely chaotic iterations (CI). We have formerly proven that the generator with CI can provide qualified chaotic random numbers. In this paper, this generator based on chaotic iterations is optimally redesigned for FPGA device. By doing so, the generation rate can be largely improved. Analyses show that these hardware generators can also provide good statistical chaotic random bits and can be cryptographically secure too. An application in the information hiding security field is finally given as an illustrative example.

Includes members:
  Member "hash functions using chaotic iterations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low cost monitoring and intruders detection using wireless video sensor networks")
  Member "an optimization technique on pseudorandom generators based on chaotic iterations":
    also connected through other hyperedges:
      (none)
  Member "a new chaos based watermarking algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an optimization technique on pseudorandom generators based on chaotic iterations")
  Member "steganography a class of secure and robust algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a robust data hiding process contributing to the development of a semantic web")
  Member "evaluating quality of chaotic pseudo random generators application to information hiding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lyapunov exponent evaluation of the cbc mode of operation")
  Member "topological chaos and chaotic iterations application to hash functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an optimization technique on pseudorandom generators based on chaotic iterations")
  Member "chaotic iterations versus spread spectrum chaos and stego security":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a cryptographic approach for steganography")

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)