human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "public key exchange using matrices over group rings"
  Abstract: We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This "nested structure" of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) and Computational Diffie-Hellman (CDH) problems for our platform.

Connected through hyperedge HE-1 (induced by source paper "using semidirect product of semi groups in public key cryptography"):
  with members:
    - "linear decomposition attack on public key exchange protocols using semidirect products of semi groups"
    - "public key exchange using semidirect product of semi groups"

Connected through hyperedge HE-2 (induced by source paper "a miniature cca2 public key encryption scheme based on non abelian factorization problems in lie groups"):
  with members:
    - "a cca secure cryptosystem using matrices over group rings"

Connected through hyperedge HE-3 (induced by source paper "public key encryption in non abelian groups"):
  with members:
    - "a cca secure cryptosystem using matrices over group rings"

Connected through hyperedge HE-4 (induced by source paper "cryptanalysis of some protocols using matrices over group rings"):
  with members:
    - "a reduction of semigroup dlp to classic dlp"
    - "a cca secure cryptosystem using matrices over group rings"

Connected through hyperedge HE-5 (induced by source paper "2 server pir with sub polynomial communication"):
  with members:
    - "improved constructions for query efficient locally decodable codes of subexponential length"
    - "query efficient locally decodable codes of subexponential length"

Question: Please tell me which class the center node 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)