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: "polynomial time attack on wild mceliece over quadratic extensions"
  Abstract: We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

Connected through hyperedge HE-1 (induced by source paper "squares of matrix product codes"):
  with members:
    - "on squares of cyclic codes"
    - "private information retrieval from coded databases with colluding servers"
    - "critical pairs for the product singleton bound"
    - "squares of random linear codes"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "an upper bound of singleton type for componentwise products of linear codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-2 (induced by source paper "encryption scheme based on expanded reed solomon codes"):
  with members:
    - "generalization of the ball collision algorithm"
    - "ledakem a post quantum key encapsulation mechanism based on qc ldpc codes"
    - "variations of the mceliece cryptosystem"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "an efficient attack of a mceliece cryptosystem variant based on convolutional codes"
    - "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes"
    - "cryptanalysis of two mceliece cryptosystems based on quasi cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "high dimensional affine codes whose square has a designed minimum distance"):
  with members:
    - "squares of matrix product codes"
    - "on squares of cyclic codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "squares of random linear codes"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-4 (induced by source paper "on decoding and applications of interleaved goppa codes"):
  with members:
    - "a public key cryptosystem from interleaved goppa codes"
    - "generalization of the ball collision algorithm"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "list decoding of binary goppa codes up to the binary johnson bound"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-5 (induced by source paper "practical algebraic attack on dags"):
  with members:
    - "on the security of some compact keys for mceliece scheme"
    - "an efficient structural attack on nist submission dags"
    - "folding alternant and goppa codes with non trivial automorphism groups"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes"
    - "a distinguisher based attack of a homomorphic encryption scheme relying on reed solomon codes"

Connected through hyperedge HE-6 (induced by source paper "on squares of cyclic codes"):
  with members:
    - "critical pairs for the product singleton bound"
    - "squares of random linear codes"
    - "an upper bound of singleton type for componentwise products of linear codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"

Connected through hyperedge HE-7 (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"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "squares of random linear codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-8 (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"
    - "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"

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)