助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   general affine 的翻译结果: 查询用时:0.012秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

general affine
相关语句
  一般仿射
     A general affine transformation involves translation,scaling and rotation operations in three dimensionalspace.
     一般仿射变换涉及3维空间的平移、缩放和旋转操作.
短句来源
  “general affine”译为未确定词的双语例句
     In this pap er,Rijndael block cipher is studied in a deep way,the modular multiply inverse element computing and affine transformation of Galois field GF(2 8 )in Bytesub transformation is merged into a S-box of8×8,the ShiftRow, MixColumn and AddRoundKey computing measured by bytes of every round is merged into a general affine transformation. The result of merging indicates that Rijnd ael cipher is a nonlinear recurrence algorithm seemed as if an affine transforma tion.
     该文对Rijndael分组密码进行了较为深入的研究,将字节代替变换中的有限域GF(28)上模乘求逆运算和仿射变换归并成了一个8×8的S盒,将圈中以字节为单位进行的行移位、列混合、密钥加三种运算归并成了一个广义仿射变换,归并结果表明Rijndael密码实质上是一个形如仿射变换的非线性迭代算法。
短句来源
     This paper makes a further study on Rijndael block cipher. The computation of inverse and affine permutation over GF(28) in ByteSub permutation are merged into a 8x8 S-box and the operation of ShiftRow, MixCol and AddRoundKey in round transformation are merged into a general affine permutation.
     深入研究了Rijndael分组密码,将字节代替变换中的有限域GF(28)上模乘求逆运算和仿射变换归并成了一个8×8的S盒,将圈中以字节为单位进行的行移位、列混合、密钥加三种运算归并成了一个广义仿射变换.
短句来源
     Compared with traditional formula of general affine Hausdorff box distance, search range of distance is reduced.
     与传统的基于广义仿射变换的Hausdorff盒距离变换公式相比,缩小了搜索距离空间。
短句来源
  相似匹配句对
     In general,L.
     L.
短句来源
     general;
     (2)总论;
短句来源
     A general affine transformation involves translation,scaling and rotation operations in three dimensionalspace.
     一般仿射变换涉及3维空间的平移、缩放和旋转操作.
短句来源
     Affine invariant parameter
     仿射不变参数化
短句来源
     On the Affine Hyperalgebra U_k
     关于仿射超代数U_k
短句来源
查询“general affine”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  general affine
The new invariants are implemented and used for matching curve segments under general affine motions and extracting symmetry axes of objects with 3D bilateral symmetry.
      
The affine quasi-invariant parameterisation is investigated in more detail and exploited for defining general affine semi-local invariants from second order derivatives only.
      
First lacuna in ordered groups of automorphisms of spaces of covector elements of a general affine connection
      
In the case of general affine geometric transformations the proposed geometric invariant is based on a scale-normalized evolution of the area.
      
It is argued that in the case of a general affine connection geodesic parameters have a nontrivial functional relation to metric interval.
      
更多          


A general affine transformation involves translation,scaling and rotation operations in three dimensionalspace.For a depth image obtained by sampling at grid points,the mapping generates a grid that is usuallystrongly deformed.We introduce a re-sampling method based on intersecting—point—finding that pro-vides exact range data at desired regular grid points.Finally we give several examples of the mapping to adepth image of a tooth model.

一般仿射变换涉及3维空间的平移、缩放和旋转操作.对于栅点上抽样所获的深度图,这类变换往往产生一个严重畸变的图象格栅.本文引入一种基于交点追踪的重新抽样方法,可以提供变换后所需规则栅点上精确的距离信息.文中最后给出了牙齿模型深度图实施所述变换的几个例子.

In this pap er,Rijndael block cipher is studied in a deep way,the modular multiply inverse element computing and affine transformation of Galois field GF(2 8 )in Bytesub transformation is merged into a S-box of8×8,the ShiftRow, MixColumn and AddRoundKey computing measured by bytes of every round is merged into a general affine transformation.The result of merging indicates that Rijnd ael cipher is a nonlinear recurrence algorithm seemed as if an affine transforma tion.Based on analysis,this paper...

In this pap er,Rijndael block cipher is studied in a deep way,the modular multiply inverse element computing and affine transformation of Galois field GF(2 8 )in Bytesub transformation is merged into a S-box of8×8,the ShiftRow, MixColumn and AddRoundKey computing measured by bytes of every round is merged into a general affine transformation.The result of merging indicates that Rijnd ael cipher is a nonlinear recurrence algorithm seemed as if an affine transforma tion.Based on analysis,this paper concisely describes Rijndael cipher algorith m,and points out an effective way of fast realization of this algorithm by pre -computation.

该文对Rijndael分组密码进行了较为深入的研究,将字节代替变换中的有限域GF(28)上模乘求逆运算和仿射变换归并成了一个8×8的S盒,将圈中以字节为单位进行的行移位、列混合、密钥加三种运算归并成了一个广义仿射变换,归并结果表明Rijndael密码实质上是一个形如仿射变换的非线性迭代算法。基于分析给出了Rijndael密码算法的精简描述,并指出了算法预计算快速实现的有效方法。

This paper makes a further study on Rijndael block cipher. The computation of inverse and affine permutation over GF(28) in ByteSub permutation are merged into a 8x8 S-box and the operation of ShiftRow, MixCol and AddRoundKey in round transformation are merged into a general affine permutation. After simplification on the basis of mergence, it results that Rijndael cipher is substantially a nonlinear recurrence algorithm of affine permutation like Y=A(?)S(X)(?)K, which is illustrated with 128 bit...

This paper makes a further study on Rijndael block cipher. The computation of inverse and affine permutation over GF(28) in ByteSub permutation are merged into a 8x8 S-box and the operation of ShiftRow, MixCol and AddRoundKey in round transformation are merged into a general affine permutation. After simplification on the basis of mergence, it results that Rijndael cipher is substantially a nonlinear recurrence algorithm of affine permutation like Y=A(?)S(X)(?)K, which is illustrated with 128 bit block and 128 bit key by giving its two-round differential attack. In addition, a simplified depiction of Rijndael algorithm is offered and an effective way to implement this algorithm rapidly by pre-computation is prosed.

深入研究了Rijndael分组密码,将字节代替变换中的有限域GF(28)上模乘求逆运算和仿射变换归并成了一个8×8的S盒,将圈中以字节为单位进行的行移位、列混合、密钥加三种运算归并成了一个广义仿射变换.基于归并将Rijndael密码算法了进行简化,结果表明Rijndael密码实质上是一个形如仿射变换Y=A(?)S(X)(?)K的非线性迭代算法,并以分组长度128比特、密钥长度128比特作为特例,给出了二轮Rijndael密码的差分攻击.文中还给出了Rijndael密码算法的精简描述,并指出了算法通过预计算快速实现的有效方法.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关general affine的内容
在知识搜索中查有关general affine的内容
在数字搜索中查有关general affine的内容
在概念知识元中查有关general affine的内容
在学术趋势中查有关general affine的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社