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: "linear complexity of legendre polynomial quotients"
  Abstract: Let p be an odd prime and w <; p be a positive integer. The authors continue to investigate the binary sequence (f#N# u#N#) over {0, 1} defined from polynomial quotients by (u#N# w#N# - u#N# wp#N#)/p modulo p. The (f#N# u#N#) is generated in terms of (-1)#N# f(u)#N# which equals to the Legendre symbol of (u#N# w#N# - u#N# wp#N#)/p (mod p) for u ≥ 0. In an earlier work, the linear complexity of (f#N# u#N#) was determined for w = p - 1 (i.e. the case of Fermat quotients) under the assumption of 2#N# p-1#N#/≡1( mod p#N# 2#N#). In this work, they develop a naive trick to calculate all possible values on the linear complexity of (f#N# u#N#) for all 1 ≤ w <; p - 1 under the same assumption. They also state that the case of larger w( ≥ p) can be reduced to that of 0 ≤ w ≤ p - 1. So far, the linear complexity is almost determined for all kinds of Legendre-polynomial quotients.

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)