发明授权
- 专利标题: Method and system for performing permutations using permutation instructions based on butterfly networks
- 专利标题(中): 使用基于蝴蝶网络的置换指令进行排列的方法和系统
-
申请号: US09850237申请日: 2001-05-07
-
公开(公告)号: US06922472B2公开(公告)日: 2005-07-26
- 发明人: Ruby B. Lee , Xiao Yang , Manish Vachharajani
- 申请人: Ruby B. Lee , Xiao Yang , Manish Vachharajani
- 申请人地址: US NJ Princeton
- 专利权人: Teleputers, LLC
- 当前专利权人: Teleputers, LLC
- 当前专利权人地址: US NJ Princeton
- 代理机构: Mathews, Shepherd, McKay & Bruneau, P.A.
- 主分类号: H04L9/34
- IPC分类号: H04L9/34 ; H04K1/04 ; H04K1/00 ; H04K1/06 ; H04K3/00
摘要:
The present invention provides permutation instructions which can be used in software executed in a programmable processor for solving permutation problems in cryptography, multimedia and other applications. The permute instructions are based on a Benes network comprising two butterfly networks of the same size connected back-to-back. Intermediate sequences of bits are defined that an initial sequence of bits from a source register are transformed into. Each intermediate sequence of bits is used as input to a subsequent permutation instruction. Permutation instructions are determined for permitting the initial source sequence of bits into one or more intermediate sequence of bits until a desired sequence is obtained. The intermediate sequences of bits are determined by configuration bits. The permutation instructions form a permutation instruction sequence of at least one instruction. At most 21 gr/m permutation instructions are used in the permutation instruction sequence, where r is the number of k-bit subwords to be permuted, and m is the number of network stages executed in one instruction. The permutation instructions can be used to permute k-bit subwords packed into an n-bit word, where k can be 1, 2, . . . , or n bits, and k*r=n.
公开/授权文献
信息查询