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: "an algebraic attack on rank metric code based cryptosystems"
  Abstract: The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic versions of it have been proposed recently, such as those in the submissions ROLLO and RQC currently at the second round of the NIST Post-Quantum Cryptography Standardization Process. While combinatorial attacks on this problem have been extensively studied and seem now well understood, the situation is not as satisfactory for algebraic attacks, for which previous work essentially suggested that they were ineffective for real parameters. In this paper, starting from Ourivski and Johansson's algebraic modelling of the problem into a system of polynomial equations, we show how to augment this system with easily computed equations so that the augmented system is solved much faster via Grobner bases. This happens because the augmented system has solving degree r or r + 1 depending on parameters, where r is the rank weight, which we show by extending results from Verbel et al. (PQCrypto 2019) who lower the solving degree to r + 2 in a similar context. We give complexity bounds for this approach as well as practical timings of an implementation using magma. This improves upon the previously known complexity estimates for both Grobner basis and (non-quantum) combinatorial approaches, and for example leads to an attack in 200 bits on ROLLO-I-256 whose claimed security was 256 bits.

Connected through hyperedge HE-1 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis"):
  with members:
    - "two attacks on rank metric code based schemes ranksign and an identity based encryption scheme"
    - "improved cryptanalysis of rank metric schemes based on gabidulin codes"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "on the complexity of the rank syndrome decoding problem"

Connected through hyperedge HE-2 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius"):
  with members:
    - "on the list decodability of rank metric codes"
    - "ramesses a rank metric encryption scheme with short keys"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "a basis for all solutions of the key equation for gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-3 (induced by source paper "ramesses a rank metric encryption scheme with short keys"):
  with members:
    - "repairing the faure loidreau public key cryptosystem"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "on the complexity of solving quadratic boolean systems"
    - "enumerative coding for grassmannian space"

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)