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 "cryptanalysis of a system based on twisted reed solomon codes"):
  Abstract: It was recently proved that twisted Reed--Solomon codes represent a family of codes which contain a large amount of MDS codes, non-equivalent to Reed--Solomon codes. As a consequence, they were proposed as an alternative to Goppa codes for the McEliece cryptosystem, resulting to a potential reduction of key sizes. #R##N#In this paper, an efficient key-recovery attack is given on this variant of the McEliece cryptosystem. The algorithm is based on the recovery of the structure of subfield subcodes of twisted Reed--Solomon codes, and it always succeeds. Its correctness is proved, and it is shown that the attack breaks the system for all practical parameters in $O(n^4)$ field operations. A practical implementation is also provided and retrieves a valid private key from the public key within just a few minutes, for parameters claiming a security level of $128$ bits. #R##N#We also discuss a potential repair of the scheme and an application of the attack to GPT cryptosystems using twisted Gabidulin codes.

Includes members:
  Member "twisted gabidulin codes in the gpt cryptosystem":
    also connected through other hyperedges:
      (none)
  Member "structural properties of twisted reed solomon codes with applications to cryptography":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a public key cryptosystem from interleaved goppa codes")
  Member "recovering short secret keys of rlce in polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "properties of constacyclic codes under the schur product")
  Member "an efficient structural attack on nist submission dags":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical algebraic attack on dags")
  Member "twisted reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "structural properties of twisted reed solomon codes with applications to cryptography")
  Member "quantum resistant random linear code based public key encryption scheme rlce":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "properties of constacyclic codes under the schur product")
  Member "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "encryption scheme based on expanded reed solomon codes")

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)