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 "on a rank metric code based cryptosystem with small key size"):
  Abstract: A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the attack. It is also shown that all other known attacks fail for our repair and parameter choices. Compared to other code-based cryptosystems, we obtain significantly smaller key sizes for the same security level.

Includes members:
  Member "sub quadratic decoding of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "fast operations on linearized polynomials and their applications in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "on the complexity of the rank syndrome decoding problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "fast encoding and decoding of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")

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)