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 "enhanced public key security for the mceliece cryptosystem"):
  Abstract: This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation-equivalent to the secret code. This increases the security level of the public key, thus opening the way for reconsidering the adoption of classical families of codes, like Reed-Solomon codes, that have been longly excluded from the McEliece cryptosystem for security reasons. It is well known that codes of these classes are able to yield a reduction in the key size or, equivalently, an increased level of security against information set decoding; so, these are the main advantages of the proposed solution. We also describe possible vulnerabilities and attacks related to the considered system, and show what design choices are best suited to avoid them.

Includes members:
  Member "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding and application to cryptography")
  Member "distinguisher based attacks on public key cryptosystems using reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "protograph based decoding of ldpc codes with hamming weight amplifiers")
  Member "an efficient cca2 secure variant of the mceliece cryptosystem in the standard model":
    also connected through other hyperedges:
      (none)
  Member "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a joint encryption encoding scheme using qc ldpc codes based on finite geometry")
  Member "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "a cca2 secure variant of the mceliece cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "provably secure group signature schemes from code based assumptions")
  Member "error correcting pairs for a public key cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "variations of the mceliece 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.IT(Information Theory)