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 "distinguisher based attacks on public key cryptosystems using reed solomon codes"):
  Abstract: Because of their interesting algebraic properties, several authors promote the use of generalized Reed-Solomon codes in cryptography. Niederreiter was the first to suggest an instantiation of his cryptosystem with them but Sidelnikov and Shestakov showed that this choice is insecure. Wieschebrink proposed a variant of the McEliece cryptosystem which consists in concatenating a few random columns to a generator matrix of a secretly chosen generalized Reed-Solomon code. More recently, new schemes appeared which are the homomorphic encryption scheme proposed by Bogdanov and Lee, and a variation of the McEliece cryptosystem proposed by Baldi et \textit{al.} which hides the generalized Reed-Solomon code by means of matrices of very low rank. #R##N#In this work, we show how to mount key-recovery attacks against these public-key encryption schemes. We use the concept of distinguisher which aims at detecting a behavior different from the one that one would expect from a random code. All the distinguishers we have built are based on the notion of component-wise product of codes. It results in a powerful tool that is able to recover the secret structure of codes when they are derived from generalized Reed-Solomon codes. Lastly, we give an alternative to Sidelnikov and Shestakov attack by building a filtration which enables to completely recover the support and the non-zero scalars defining the secret generalized Reed-Solomon code.

Includes members:
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "squares of matrix product codes")
  Member "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "a distinguisher based attack of a homomorphic encryption scheme relying on reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical algebraic attack on dags")
  Member "error correcting pairs for a public key cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "variations of the mceliece cryptosystem")
  Member "homomorphic encryption from codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polynomial time attack on wild mceliece over quadratic extensions")
  Member "enhanced public key security for the mceliece cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the security of a loidreau s rank metric code based encryption scheme")

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.CR(Cryptography and Security)