human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "improved cryptanalysis of rank metric schemes based on gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "distinguisher based attacks on public key cryptosystems using reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "on the complexity of the rank syndrome decoding problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "a smart approach for gpt cryptosystem based on rank codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interleaving loidreau s rank metric cryptosystem")
  Member "on improving security of gpt cryptosystems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interleaving loidreau s rank metric cryptosystem")

Question: Please tell me which class the source paper 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)