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 "pre and post quantum diffie hellman from groups actions and isogenies"):
  Abstract: Diffie-Hellman key exchange is at the foundations of public-key cryptography, but conventional group-based Diffie-Hellman is vulnerable to Shor's quantum algorithm. A range of 'post-quantum Diffie-Hellman' protocols have been proposed to mitigate this threat, including the Couveignes, Rostovtsev-Stolbunov, SIDH, and CSIDH schemes, all based on the combinatorial and number-theoretic structures formed by isogenies of elliptic curves. Pre-and post-quantum Diffie-Hellman schemes resemble each other at the highest level, but the further down we dive, the more differences emerge-differences that are critical when we use Diffie-Hellman as a basic component in more complicated constructions. In this survey we compare and contrast pre-and post-quantum Diffie-Hellman algorithms, highlighting some important subtleties.

Includes members:
  Member "a note on the security of csidh":
    also connected through other hyperedges:
      (none)
  Member "towards practical key exchange from ordinary isogeny graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stronger and faster side channel protections for csidh")
  Member "mathematics of isogeny based cryptography":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards practical key exchange from ordinary isogeny graphs")
  Member "a kilobit hidden snfs discrete logarithm computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "breaking the encryption scheme of the moscow internet voting system")
  Member "montgomery curves and their arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stronger and faster side channel protections for csidh")
  Member "mu kummer efficient hyperelliptic signatures and key exchange on microcontrollers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "aris authentication for real time iot systems")
  Member "general impossibility of group homomorphic encryption in the quantum world":
    also connected through other hyperedges:
      (none)
  Member "an l 1 3 discrete logarithm algorithm for low degree curves":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an optimal representation for the trace zero subgroup")

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)