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: "cryptographically strong permutations from the butterfly structure"
  Abstract: In this paper, we present infinite families of permutations of $\mathbb{F}_{2^{2n}}$ with high nonlinearity and boomerang uniformity $4$ from generalized butterfly structures. #R##N#Both open and closed butterfly structures are considered. It appears, according to experiment results, that open butterflies do not produce permutation with boomerang uniformity $4$. #R##N#For the closed butterflies, we propose the condition on coefficients $\alpha, \beta \in \mathbb{F}_{2^n}$ such that the functions #R##N#$$V_i := (R_i(x,y), R_i(y,x))$$ with $R_i(x,y)=(x+\alpha y)^{2^i+1}+\beta y^{2^i+1}$ are permutations of $\mathbb{F}_{2^n}^2$ with boomerang uniformity $4$, where $n\geq 1$ is an odd integer and $\gcd(i, n)=1$. #R##N#The main result in this paper consists of two major parts: the permutation property of $V_i$ is investigated in terms of the univariate form, and the boomerang uniformity is examined in terms of the original bivariate form. In addition, experiment results for $n=3, 5$ indicates that the proposed condition seems to cover all coefficients $\alpha, \beta \in \mathbb{F}_{2^n}$ that produce permutations $V_i$ with boomerang uniformity $4$. #R##N#However, the experiment result shows that the quadratic permutation $V_i$ seems to be affine equivalent to the Gold function. Therefore, unluckily, we may not to obtain new permutations with boomerang uniformity $4$ from the butterfly structure.

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)