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: "a highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree"
  Abstract: Functions with low differential uniformity can be used as the s-boxes of symmetric cryptosystems as they have good resistance to differential attacks. The AES (Advanced Encryption Standard) uses a differentially-4 uniform function called the inverse function. Any function used in a symmetric cryptosystem should be a permutation. Also, it is required that the function is highly nonlinear so that it is resistant to Matsui's linear attack. In this article we demonstrate that a highly nonlinear permutation discovered by Hans Dobbertin has differential uniformity of four and hence, with respect to differential and linear cryptanalysis, is just as suitable for use in a symmetric cryptosystem as the inverse function.

Connected through hyperedge HE-1 (induced by source paper "on permutation quadrinomials and 4 uniform bct"):
  with members:
    - "new results about the boomerang uniformity of permutation polynomials"
    - "on a conjecture about a class of permutation quadrinomials"
    - "solutions of x q k cdots x q x a in gf 2 n"
    - "differentially 4 uniform permutations with the best known nonlinearity from butterflies"

Connected through hyperedge HE-2 (induced by source paper "on the differential linear connectivity table of vectorial boolean functions"):
  with members:
    - "new results about the boomerang uniformity of permutation polynomials"
    - "on the boomerang uniformity of quadratic permutations over f 2 n"

Connected through hyperedge HE-3 (induced by source paper "new results about the boomerang uniformity of permutation polynomials"):
  with members:
    - "on the boomerang uniformity of quadratic permutations over f 2 n"
    - "a few more quadratic apn functions"

Connected through hyperedge HE-4 (induced by source paper "on the boomerang uniformity of quadratic permutations over f 2 n"):
  with members:
    - "new results about the boomerang uniformity of permutation polynomials"

Connected through hyperedge HE-5 (induced by source paper "differentially low uniform permutations from known 4 uniform functions"):
  with members:
    - "a few more quadratic apn functions"

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.IT(Information Theory)