公开(公告)号：EP1547301A1

公开(公告)日：2005-06-29

申请号：EP03766605.4

申请日：2003-08-06

申请人： Discretix Technologies, Ltd.

发明人： GUERON, Shay ,  ZUK, Or

IPC分类号： H04L9/00 ,  H04L9/30 ,  H04L9/14 ,  H04L9/32

CPC分类号： G06F7/724 ,  G06F2207/7209 ,  H04L9/0631 ,  H04L9/0637 ,  H04L2209/12

摘要： Embodiments of the invention provide a method and a device for manipulating data provided in a GF(22s) representation, e.g., for implementing at least some AES encryption and/or decryption operations on data provided in a GF(22s) representation, by converting the GF(22s) into a GF((2s)2) representation (102) and performing GF(22s) equivalent operations in the GF((2s)2) representation (104).

公开(公告)号：EP1421472B1

公开(公告)日：2007-06-13

申请号：EP02726404.3

申请日：2002-04-22

申请人： Discretix Technologies Ltd.

发明人： GUERON, Shay ,  HADAD, Isaac

IPC分类号： G06F7/72

CPC分类号： G06F7/728

摘要： A method for carrying out modular arithmetic computations involving multiplication operations by utilizing a non-reduced and extended Montgomery multiplication between a first A and a second B integer values, in which the number of iterations required is greater than the number of bits n of an odd modulo value N. The method comprises storing n+2 bit values in an accumulating device (S) capable of, of adding n+2-bit values (X) to it content, and of dividing its content by 2. Whenever desired, the content of the accumulating device is set to zero value. At least s(>n+1) iterations of the following steps are performed, while in each iteration choosing one bit, in sequence, from the value of said first integer value A, starting from its least significant bit: adding to the content of the accumulating device S the product of the selected bit and said second integer value B; adding to the resulting content the product of its current least significant bit and N; dividing the result by 2; and obtaining a non-reduced and extended Montgomery multiplication result by repeating these steps s-1 additional times while in each time using the previous result (S).

公开(公告)号：EP1595357A2

公开(公告)日：2005-11-16

申请号：EP04708426.4

申请日：2004-02-05

申请人： Discretix Technologies, Ltd.

发明人： GUERON, Shay ,  PARZANCHEVSKI, Ori ,  ZUK, Or

IPC分类号： H04L9/00

CPC分类号： G06F7/00 ,  G06F7/724 ,  G06F2207/7209 ,  G06F2207/7219 ,  G06F2207/7233 ,  H04L9/003 ,  H04L9/0631 ,  H04L2209/046

摘要： Embodiments of the invention provide a method and a device for manipulating data (108) by converting masked data in a first representation of a finite field into converted data in a second representation of the finite field (102), and manipulating the converted data (106) to obtain manipulated masked data.

公开(公告)号：EP1421472A2

公开(公告)日：2004-05-26

申请号：EP02726404.3

申请日：2002-04-22

申请人： Discretix Technologies Ltd.

发明人： GUERON, Shay ,  HADAD, Isaac

IPC分类号： G06F7/72

CPC分类号： G06F7/728

摘要： A method for carrying out modular arithmetic computations involving multiplication operations by utilizing a non-reduced and extended Montgomery multiplication between a first A and a second B integer values, in which the number of iterations required is greater than the number of bits n of an odd modulo value N. The method comprises storing n+2 bit values in an accumulating device (S) capable of, of adding n+2-bit values (X) to it content, and of dividing its content by 2. Whenever desired, the content of the accumulating device is set to zero value. At least s(>n+1) iterations of the following steps are performed, while in each iteration choosing one bit, in sequence, from the value of said first integer value A, starting from its least significant bit: adding to the content of the accumulating device S the product of the selected bit and said second integer value B; adding to the resulting content the product of its current least significant bit and N; dividing the result by 2; and obtaining a non-reduced and extended Montgomery multiplication result by repeating these steps s-1 additional times while in each time using the previous result (S).