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: "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
  Abstract: We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes. It leads to a feasible attack on one of the parameters suggested in \cite{GMRZ13}.

Connected through hyperedge HE-1 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis"):
  with members:
    - "an algebraic attack on rank metric code based cryptosystems"
    - "two attacks on rank metric code based schemes ranksign and an identity based encryption scheme"
    - "improved cryptanalysis of rank metric schemes based on gabidulin codes"
    - "on the complexity of the rank syndrome decoding problem"

Connected through hyperedge HE-2 (induced by source paper "interleaving loidreau s rank metric cryptosystem"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "decoding high order interleaved rank metric codes"
    - "on decoding and applications of interleaved goppa codes"
    - "a public key cryptosystem from interleaved goppa codes"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "further generalisations of twisted gabidulin codes"

Connected through hyperedge HE-3 (induced by source paper "improved veron identification and signature schemes in the rank metric"):
  with members:
    - "wave a new code based signature scheme"
    - "ranksign an efficient signature algorithm based on the rank metric"
    - "efficient encryption from random quasi cyclic codes"
    - "a new algorithm for solving ring lpn with a reducible polynomial"
    - "on the complexity of the rank syndrome decoding problem"
    - "a new zero knowledge code based identification scheme with reduced communication"
    - "properties of codes in rank metric"

Connected through hyperedge HE-4 (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"
    - "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"
    - "cryptanalysis of two mceliece cryptosystems based on quasi cyclic codes"
    - "properties of codes in rank metric"

Connected through hyperedge HE-5 (induced by source paper "mcnie a code based public key cryptosystem"):
  with members:
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "on the complexity of the rank syndrome decoding problem"

Connected through hyperedge HE-6 (induced by source paper "ranksynd a prng based on rank metric"):
  with members:
    - "on the hardness of the decoding and the minimum distance problems for rank codes"
    - "on the complexity of the rank syndrome decoding problem"

Connected through hyperedge HE-7 (induced by source paper "folding alternant and goppa codes with non trivial automorphism groups"):
  with members:
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "key reduction of mceliece s cryptosystem using list decoding"
    - "cryptanalysis of two mceliece cryptosystems based on quasi cyclic 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)