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 "variations of the mceliece cryptosystem"):
  Abstract: Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added in the encryption process, can be controlled so that efficient decryption remains possible. The second variation is based on the use of spatially coupled moderate-density parity-check codes as secret codes. These codes are known for their excellent error-correction performance and allow for a relatively low key size in the cryptosystem. For both variants the security with respect to known attacks is discussed.

Includes members:
  Member "soft mceliece mdpc code based mceliece cryptosystems with very compact keys through real valued intentional errors":
    also connected through other hyperedges:
      (none)
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a polynomial time attack on the bbcrs scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the security of a loidreau s rank metric code based encryption scheme")
  Member "spatially coupled sparse codes on graphs theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial time attack on wild mceliece over quadratic extensions")
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "squares of matrix product codes")
  Member "a polynomial time attack against algebraic geometry code based public key cryptosystems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mcnie a code based public key cryptosystem")
  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)