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 "interleaving loidreau s rank metric cryptosystem"):
  Abstract: We propose and analyze an interleaved variant of Loidreau's rank-metric cryptosystem based on rank multipliers. It can be seen as the rank-metric analog of a recent proposal based on interleaved Goppa codes by Elleuch et al.. We analyze and adapt several attacks on the system, propose design rules, and study weak keys. Finding secure instances requires near-MRD rank-metric codes, which is so far underrepresented in the literature and leaves an interesting open problem. We give example parameters for potential key size reduction.

Includes members:
  Member "low rank parity check codes new decoding algorithms and applications to cryptography":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low rank parity check codes over the ring of integers modulo a prime power")
  Member "on the security of a loidreau s rank metric code based encryption scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "decoding high order interleaved rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient decoding of interleaved low rank parity check codes")
  Member "on decoding and applications of interleaved goppa codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "a public key cryptosystem from interleaved goppa codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "repairing the faure loidreau public key cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "further generalisations of twisted gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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.IT(Information Theory)