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 "a secret key generation scheme for internet of things using ternary states reram based physical unclonable functions"):
  Abstract: Some of the main challenges towards utilizing conventional cryptographic techniques in Internet of Things (IoT) include the need for generating secret keys for such a large-scale network, distributing the generated keys to all the devices, key storage as well as the vulnerability to security attacks when an adversary gets physical access to the devices. In this paper, a novel secret key generation method is proposed for IoTs that utilize the intrinsic randomness embedded in the devices' memories introduced in the manufacturing process. A fuzzy extractor structure using serially concatenated BCH-Polar codes is proposed to generate reproducible keys from a ReRAM-based \emph{ternary-state} Physical Unclonable Functions (PUFs) for device authentication and secret key generation. The ReRAM based PUFs are the most practical choice for authentication and key generation in IoT, as they operate at or below the systems' noise level and therefore are less vulnerable to side channel attacks compared to the alternative memory technologies. However, the current ReRAM-based PUFs present a high false negative authentication rate since the behavior of these devices can vary in different physical conditions that results in a low probability of regenerating the same response in different attempts. In this paper, we propose a secret key generation scheme for ternary state PUFs that enables reliable reconstruction of the desired secret keys utilizing a serially concatenated BCH-Polar fuzzy extractor. The experimental results show that the proposed model can offer a significantly lower probability of mismatch between the original key and the regenerated ones, while a less number of \textit{Helper data} bits were used to extract the \textit{Key} when compared to previously proposed fuzzy extractor techniques.

Includes members:
  Member "a reram physically unclonable function reram puf based approach to enhance authentication security in software defined wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on hardware based security mechanisms for internet of things")
  Member "high rate error correction schemes for sram pufs based on polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on hardware based security mechanisms for internet of things")
  Member "on error correction for physical unclonable functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on hardware based security mechanisms for internet of things")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and algorithms")

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)