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: "quantum resistant random linear code based public key encryption scheme rlce"
  Abstract: Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, key recovery cryptanalysis techniques for linear code based cryptographic systems are generally scheme specific. In recent years, several important techniques such as Sidelnikov-Shestakov attack, filtration attacks, and algebraic attacks have been developed to crypt-analyze linear code based encryption schemes. Though most of these cryptanalysis techniques are relatively new, they prove to be very powerful and many systems have been broken using them. Thus it is important to design linear code based cryptographic systems that are immune against these attacks. This paper proposes linear code based encryption scheme RLCE which shares many characteristics with random linear codes. Our analysis shows that the scheme RLCE is secure against existing attacks and we hope that the security of the RLCE scheme is equivalent to the hardness of decoding random linear codes. Example parameters for different security levels are recommended for the scheme RLCE.

Connected through hyperedge HE-1 (induced by source paper "cryptanalysis of a system based on twisted reed solomon codes"):
  with members:
    - "twisted gabidulin codes in the gpt cryptosystem"
    - "structural properties of twisted reed solomon codes with applications to cryptography"
    - "recovering short secret keys of rlce in polynomial time"
    - "an efficient structural attack on nist submission dags"
    - "twisted reed solomon codes"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "properties of constacyclic codes under the schur product"):
  with members:
    - "squares of matrix product codes"
    - "on squares of cyclic codes"
    - "recovering short secret keys of rlce in polynomial time"
    - "an efficient structural attack on nist submission dags"
    - "a generalization of quasi twisted codes multi twisted codes"
    - "squares of random linear codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-3 (induced by source paper "an efficient structural attack on nist submission dags"):
  with members:
    - "on the security of some compact keys for mceliece scheme"
    - "squares of random linear codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "folding alternant and goppa codes with non trivial automorphism groups"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-4 (induced by source paper "recovering short secret keys of rlce in polynomial time"):
  with members:
    - "squares of random linear codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "enhanced public key security for the mceliece cryptosystem"

Connected through hyperedge HE-5 (induced by source paper "cryptanalysis of a public key encryption scheme based on qc ldpc and qc mdpc codes"):
  with members:
    - "worst case qc mdpc decoder for mceliece cryptosystem"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "an efficient attack of a mceliece cryptosystem variant based on convolutional codes"

Connected through hyperedge HE-6 (induced by source paper "decoding generalized reed solomon codes and its application to rlce encryption schemes"):
  with members:
    - "power decoding reed solomon codes up to the johnson radius"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"

Connected through hyperedge HE-7 (induced by source paper "using reed solomon codes in the left u mid u v right construction and an application to cryptography"):
  with members:
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

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)