查询词典 permutation operator

We provide a substitution box, exponential permutation which has much measurable security, and give a enumerating result and a fast algorithm of calculating such permutation. An almost perfect nonlinear exponential permutation with high algebric degree is proposed. with some discussion on how to select the parameters of such permutation. The experimental result shows us a conjecture that there exists no such permutation over even dimensional space. As a way of generating substitution boxes, we briefly point out the cryptographic weakness of the exponential functions derived from such permutation. We also present two new cryptographic indexes, fixed point and cyclic structure, on which we investigate the performance of such permutation. Finally, we give a viewpoint about the application of correlation immune functions in designing substitution boxes.

提供了一种可度量安全强度的代换盒－幂置换；详细阐述了幂置换的实现和计数问题；给出了一种计算幂置换的快速算法；从几乎完善非线性幂置换角度讨论了幂置换参数的选取，并提出了一种高次几乎完善非线性置换；通过试验给出了关于偶数维空间上几乎完善非线性幂置换的一个猜想；简要给出了由幂置换派生出的幂函数的密码局限性；针对幂置换，提出了两个密码安全指标：不动点和循环结构；证明了幂置换在这两个指标下的密码性能；简要讨论了相关免疫函数与代换盒设计的关系。

Op1 + op2 The addition operator will add two numbers. op1 - op2 The subtraction operator will subtract two numbers. op1 * op2 The multiplication operator will multiply two numbers. op1 / op2 The division operator will divide two numbers. op1 % op2 The modulus operator will return the remainder of the division of two integer operands. op1 xx op2 The exponentiation operator will raise op1 to the power of op2.++op1 The pre-increpment operator will increase the value of op1 first, then assign it. op1++ The post-increment operator will increase the value of op1 after it is assigned.--op1 The pre-decrement operator will decrease the value of op1 before it is assigned. op1-- The post-decrement operator will decrease the value of op1 after it is assigned.

op1 + op2 对两个数值做加法操作 op1 - op2 对两个数值做减法操作 op1 * op2 对两个数值做乘法操作 op1 / op2 对两个数值做除法操作 op1 % op2 求两个整型数值的余数 op1 xx op2 求幂操作：求 op1 的 op2 次幂++op1 前加操作： op1 的值先增加，然后将值赋给自身 op1++后加操作： op1 的值先赋给自身，再增加值--op1 前减操作： op1 的值先减少，然后将值赋给自身 op1—后减操作： op1 的值先赋给自身，再减少值

The orbits of the point stabilizer of a finite permutation group are called the suborbits of the permutation group. The determination of the suborbits of a permutation group is one of the basic problems in the permutation group theory. It plays an important role in the study of combinatorial structures.

一个有限传递置换群的点稳定子群的轨道称为该群的次轨道，决定一个置换群的次轨道结构是置换群理论的基本问题之一，它在组合结构的研究中有着重要的应用。

The introduction of displacement operator, derivation operator, integral operator and the operator, such as differential calculus operator and the definition of the form of computing, will be applied to similar derivation formula gives Newton a Kete Si formula and Bernstein theorem Law said the operator, and form is derived; linear differential equations is the operator solution.

有没有高手可以帮我翻译下这段话啊？？？引入位移算子、求导算子、积分算子和差分算子等微积分算子的定义及其形式运算，将其应用于近似求导公式；给出牛顿一柯特斯公式和伯恩斯坦定理的算子法表示，并进行形式推导；给出线性常微分方程的算子解法。

Then we sharpen the images with Laplace operator. In the course of edge detection, we detect images' edge by using Roberts operator, Sobel operator, Robinson operator, LoG operator and Canny operator, and compare the results of images' edge. The result shows, Canny edge detection operator precede other operators obviously.

在对图像进行边缘检测时，对经过预处理过的人脸图像分别用Roberts边缘算子、Sobel边缘算子、Robinson边缘算、LoG边缘算子、Canny边缘算子进行边缘检测，然后，对边缘检测算子进行了研究改进，并对检测结果进行了讨论比较，结果表明，Canny边缘算子的检测结果明显优于其它几个算子。

Characteristics of a number of gates from the set of all generalized Toffoli gates are studied. Any permutation S is proved to be generated by a n-cycle δ and a permutation τ=i(subscript j, i together. It shows that any neighboring 2-cycle permutation can be generated by at most two NOT gates without ancilla bit.

本文研究了生成Toffoli门集合的可逆逻辑门数的特点，证明了任意置换S可以由n-轮换δ和一个置换τ=i(下标 j，i生成，同时证明了相邻2-轮换可由至多两个NOT门在不增加额外信息位的情况下生成。

After comparing the two type of tests,we came to some conclusions.The tests based on binomial test can be regarded as some kind of permutation tests under certain definition of "permutaton".If the tests are related to statistics,then whether they can be viewed as permutation tests depends on if the value of the probability,p,is known where p is the population parameter in the null hypothesis.For tests like Kolmogorov goodness-of-fit test,since the statistics is calculated based on empirical distribution function,hence no matter how we repermutate the observations,the order statistics is the same.This kind of tests can't be regarded as permutation tests.

我们得到的结论为：在一般的无母数检定中，如果检定与binomial test相关，基本上都可以视作排列检定的一种；与卡方检定相关的检定，基本上和p值已知或是未知有关，这个p值为原始假设下所要检定的母体机率值；其他检定如Kolmogorov goodness-of-fit test，由於统计量的值是根据empirical distribution function决定，而不论如何重新排列样本，其顺序统计量都不变，所以无法视为一种排列检定。

A fast algorithm for calculating the inverse and Moore-Penrose inverse of the permutation factor circulant matrix is presented. Then, a fast algorithm for the product of the permutation factor circulant matrix is given. Finally, The least-square solutions of inverse problems and the optimal approximation problems for the permutation factor circulant matrix are discussed.

首先给出了一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法，然后给出了计算两n阶置换因子循环矩阵之乘积阵的一种快速算法，最后给出了其反问题的最小二乘解的存在性定理及它的一般表示，并证明了逼近矩阵的存在唯一性且给出它的具体表达式。

An almost perfect nonlinear exponential permutation with high algebric degree is proposed, with some discussion on how to select the parameters of such permutation. The experimental result shows us a conjecture that there exists no such permutation over even dimensional space.

作者所取得的主要研究结果如下：(1)讨论了分组密码的条件攻击和技术攻击方法；全面总结了分组密码算法设计应当遵循的七项准则；概括了分组密码的四种强化技术；设计了一种新的三重加密方案NTE。

The four round MISTY-type and the three round dual MISTY-type transformation are optimized by replacing the first round pseudorandom permutation with XOR-universal permutation and employing identical pseudorandom permutation in the second and the third round.

在保持其安全性不变的情况下，把4轮MISTY结构中第1轮的伪随机置换，用一个XOR-泛置换代替，第2，第3轮采用相同的伪随机置换，3轮结构中第1轮的伪随机置换用XOR-泛置换代替，其它轮相同。

Panorama Many people are dancing in a large sitting room.

在一个大客厅里，许多人在跳舞。

We fully understand how a microwave oven cooks food, it is first necessary to talk ...

我们充分理解一个微波炉煮的食物，这是首先要谈。。。