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 key recovery attack on the faure loidreau scheme based on gabidulin codes"
  Abstract: Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of thousands bytes even with additional structures like the cyclicity. The main tool for building public key encryption schemes in rank metric is the McEliece encryption setting used with the family of Gabidulin codes. Since the original scheme proposed in 1991 by Gabidulin, Paramonov and Tretjakov, many systems have been proposed based on different masking techniques for Gabidulin codes. Nevertheless, over the years all these systems were attacked essentially by the use of an attack proposed by Overbeck. #R##N#In 2005 Faure and Loidreau designed a rank-metric encryption scheme which was not in the McEliece setting. The scheme is very efficient, with small public keys of size a few kiloBytes and with security closely related to the linearized polynomial reconstruction problem which corresponds to the decoding problem of Gabidulin codes. The structure of the scheme differs considerably from the classical McEliece setting and until our work, the scheme had never been attacked. We show in this article that this scheme like other schemes based on Gabidulin codes, is also vulnerable to a polynomial-time attack that recovers the private key by applying Overbeck's attack on an appropriate public code. As an example we break concrete proposed $80$ bits security parameters in a few seconds.

Connected through hyperedge HE-1 (induced by source paper "decoding high order interleaved rank metric codes"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "on decoding and applications of interleaved goppa codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "on a rank metric code based cryptosystem with small key size"
    - "a public key cryptosystem from interleaved goppa codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "fast multiplication for skew polynomials"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"

Connected through hyperedge HE-2 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius"):
  with members:
    - "on the list decodability of rank metric codes"
    - "ramesses a rank metric encryption scheme with short keys"
    - "an algebraic attack on rank metric code based cryptosystems"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "a basis for all solutions of the key equation for gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-3 (induced by source paper "ramesses a rank metric encryption scheme with short keys"):
  with members:
    - "an algebraic attack on rank metric code based cryptosystems"
    - "repairing the faure loidreau public key cryptosystem"
    - "on the complexity of solving quadratic boolean systems"
    - "enumerative coding for grassmannian space"

Connected through hyperedge HE-4 (induced by source paper "partition balanced families of codes and asymptotic enumeration in coding theory"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "automorphism groups of gabidulin like codes"
    - "algebraic structures of mrd codes"
    - "rank distribution of delsarte codes"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-5 (induced by source paper "on a rank metric code based cryptosystem with small key size"):
  with members:
    - "sub quadratic decoding of gabidulin codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "fast encoding and decoding of gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-6 (induced by source paper "repairing the faure loidreau public key cryptosystem"):
  with members:
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "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)