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: "new results about the boomerang uniformity of permutation polynomials"
  Abstract: In EUROCRYPT 2018, Cid et al. \cite{BCT2018} introduced a new concept on the cryptographic property of S-boxes: Boomerang Connectivity Table (BCT for short) for evaluating the subtleties of boomerang-style attacks. Very recently, BCT and the boomerang uniformity, the maximum value in BCT, were further studied by Boura and Canteaut \cite{BC2018}. Aiming at providing new insights, we show some new results about BCT and the boomerang uniformity of permutations in terms of theory and experiment in this paper. Firstly, we present an equivalent technique to compute BCT and the boomerang uniformity, which seems to be much simpler than the original definition from \cite{BCT2018}. Secondly, thanks to Carlet's idea \cite{Carlet2018}, we give a characterization of functions $f$ from $\mathbb{F}_{2}^n$ to itself with boomerang uniformity $\delta_{f}$ by means of the Walsh transform. Thirdly, by our method, we consider boomerang uniformities of some specific permutations, mainly the ones with low differential uniformity. Finally, we obtain another class of $4$-uniform BCT permutation polynomials over $\mathbb{F}_{2^n}$, which is the first binomial.

Connected through hyperedge HE-1 (induced by source paper "on permutation quadrinomials and 4 uniform bct"):
  with members:
    - "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"
    - "a highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree"

Connected through hyperedge HE-2 (induced by source paper "4 uniform bct permutations from generalized butterfly structure"):
  with members:
    - "on the boomerang uniformity of quadratic permutations over f 2 n"
    - "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-3 (induced by source paper "on the differential linear connectivity table of vectorial boolean functions"):
  with members:
    - "on the boomerang uniformity of quadratic permutations over f 2 n"
    - "a highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree"

Connected through hyperedge HE-4 (induced by source paper "on the boomerang uniformity of quadratic permutations over f 2 n"):
  with members:
    - "a highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree"

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)