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 "soft mceliece mdpc code based mceliece cryptosystems with very compact keys through real valued intentional errors"):
  Abstract: We propose to use real-valued errors instead of classical bit flipping intentional errors in the McEliece cryptosystem based on moderate-density parity-check (MDPC) codes. This allows to exploit the error correcting capability of these codes to the utmost, by using soft-decision iterative decoding algorithms instead of hard-decision bit flipping decoders. However, soft reliability values resulting from the use of real-valued noise can also be exploited by attackers. We devise new attack procedures aimed at this, and compute the relevant work factors and security levels. We show that, for a fixed security level, these new systems achieve the shortest public key sizes ever reached, with a reduction up to 25% with respect to previous proposals.

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 "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "protograph based decoding of ldpc codes with hamming weight amplifiers")
  Member "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a joint encryption encoding scheme using qc ldpc codes based on finite geometry")
  Member "scaling efficient code based cryptosystems for embedded platforms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes")
  Member "on a family of circulant matrices for quasi cyclic low density generator matrix codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "array convolutional low density parity check 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)