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: "enhanced public key security for the mceliece cryptosystem"
  Abstract: This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation-equivalent to the secret code. This increases the security level of the public key, thus opening the way for reconsidering the adoption of classical families of codes, like Reed-Solomon codes, that have been longly excluded from the McEliece cryptosystem for security reasons. It is well known that codes of these classes are able to yield a reduction in the key size or, equivalently, an increased level of security against information set decoding; so, these are the main advantages of the proposed solution. We also describe possible vulnerabilities and attacks related to the considered system, and show what design choices are best suited to avoid them.

Connected through hyperedge HE-1 (induced by source paper "on the security of a loidreau s rank metric code based encryption scheme"):
  with members:
    - "a polynomial time attack on the bbcrs scheme"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "the niederreiter cryptosystem and quasi cyclic codes"):
  with members:
    - "succinct quantum proofs for properties of finite groups"

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"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "recovering short secret keys of rlce in polynomial time"):
  with members:
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a new class of convolutional codes and its use in the mceliece cryptosystem"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "superregular matrices and applications to convolutional codes"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "a new class of superregular matrices and mdp convolutional codes"

Connected through hyperedge HE-6 (induced by source paper "ledakem a post quantum key encapsulation mechanism based on qc ldpc codes"):
  with members:
    - "quantum information set decoding algorithms"
    - "worst case qc mdpc decoder for mceliece cryptosystem"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "cryptanalysis of two mceliece cryptosystems based on quasi cyclic codes"

Connected through hyperedge HE-7 (induced by source paper "on decoding schemes for the mdpc mceliece cryptosystem"):
  with members:
    - "moderate density parity check codes"

Connected through hyperedge HE-8 (induced by source paper "a quantum secure niederreiter cryptosystem using quasi cyclic codes"):
  with members:
    - "decoding of quasi cyclic codes up to a new lower bound on the minimum distance"

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.IT(Information Theory)