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: "cryptanalysis of two mceliece cryptosystems based on quasi cyclic codes"
  Abstract: We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers subcodes of a primitive BCH code. We prove that this variant is not secure by finding and solving a linear system satisfied by the entries of the secret permutation matrix. #R##N#The other variant uses quasi-cyclic low density parity-check codes. This scheme was devised to be immune against general attacks working for McEliece type cryptosystems based on low density parity-check codes by choosing in the McEliece scheme more general one-to-one mappings than permutation matrices. We suggest here a structural attack exploiting the quasi-cyclic structure of the code and a certain weakness in the choice of the linear transformations that hide the generator matrix of the code. Our analysis shows that with high probability a parity-check matrix of a punctured version of the secret code can be recovered in cubic time complexity in its length. The complete reconstruction of the secret parity-check matrix of the quasi-cyclic low density parity-check codes requires the search of codewords of low weight which can be done with about $2^{37}$ operations for the specific parameters proposed.

Connected through hyperedge HE-1 (induced by source paper "protograph based decoding of ldpc codes with hamming weight amplifiers"):
  with members:
    - "on decoding schemes for the mdpc mceliece cryptosystem"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "analysis and design of binary message passing decoders"

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"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "low rank parity check codes new decoding algorithms and applications to cryptography"):
  with members:
    - "ranksynd a prng based on rank metric"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "properties of codes in rank metric"

Connected through hyperedge HE-4 (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"
    - "polynomial time attack on wild mceliece over quadratic extensions"

Connected through hyperedge HE-5 (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"
    - "enhanced public key security for the mceliece cryptosystem"

Connected through hyperedge HE-6 (induced by source paper "variations of the mceliece cryptosystem"):
  with members:
    - "soft mceliece mdpc code based mceliece cryptosystems with very compact keys through real valued intentional errors"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a polynomial time attack on the bbcrs scheme"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-7 (induced by source paper "polynomial time attack on wild mceliece over quadratic extensions"):
  with members:
    - "linear independence of rank 1 matrices and the dimension of products of codes"
    - "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"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "folding alternant and goppa codes with non trivial automorphism groups"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-8 (induced by source paper "folding alternant and goppa codes with non trivial automorphism groups"):
  with members:
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "key reduction of mceliece s cryptosystem using list decoding"

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)