Patent Document

BACKGROUND OF THE INVENTION 
       [0001]    1. Field of the Invention 
         [0002]    The invention relates to crypto-engines for cryptographic processing of data. More particularly, the invention relates to a crypto-engine capable of executing either Rivest-Shamir-Adleman (RSA) or Elliptic Curve Cryptography (ECC) public key encryption protocols. 
         [0003]    2. Description of Prior Art 
         [0004]    The RSA public-key cryptosystem devised by Rivest, Shamir and Adleman and the EEC cryptosystem devised by Koblitz and Miller are two common algorithms adopted by public key infrastructures. 
         [0005]    RSA involves a computation of the exponentiation and modulo of product of two large prime numbers whereas ECC is based on computations with points on an elliptic curve. To achieve faster speed, hardware architectures are normally used to implement these algorithms. 
         [0006]    In RSA, the main basic operation is the modular multiplication. When the ECC is implemented over the field GF(p), where p is a large prime number, the main basic operations are also modular multiplication. Thus the two algorithms share a common operation. However, in known hardware architectures resources cannot be shared by the algorithms and reused. 
       SUMMARY OF THE INVENTION 
       [0007]    It is an object of the present invention to provide a hardware based crypto-engine for asymmetric cryptograhic processing using RCA or ECC algorithms. It is a further object of the invention to provide a crypto-engine that operates as a coprocessor to a host processor. 
         [0008]    According to the invention there is provided a crypto-engine for cryptographic processing of data comprising an arithmetic unit operable as a co-processor for a host processor and an interface controller for managing communications between the arithmetic unit and host processor, the arithmetic unit including:
       a memory unit for storing and loading data,   a multiplication unit, an addition unit and a sign inversion unit for performing arithmetic operations on said data, and   an arithmetic controller for controlling the storing and loading of data by the memory unit and for enabling the multiplication, addition and sign inversion units.       
 
         [0012]    Preferably, the memory unit comprises:
       an input switch for selecting input/interim data,   a plurality of Static Random Access Memory elements for receiving and storing the input/interim data from the input switch,   a plurality of output switches connected to the memory elements, and   an address controller for controlling flow of the data through the switches and memory elements.       
 
         [0017]    Preferably, the multiplication unit comprises:
       a register to pre-store the multiplier data,   a pair of multiplication elements for performing multiplication,   a shift register to load the multiplier data bitwise into the multiplication elements, and   a first-in-first-out register for synchronizing data is movement between the multiplication elements.       
 
         [0022]    Preferably, the multiplication elements comprise a bitwise segmented multiplier, a bitwise segmented multiplicand, and a modulo for performing modular multiplication of the multiplier and multiplicand according to the modulo value. 
         [0023]    Preferably, the interface controller comprises
       a bus interface for connecting high frequency manipulated data inside the arithmetic unit with the lower frequency manipulated data in the host processor,   a concatenater/splitter for merging or splitting data width, and   a cryptographic controller for generating status and interrupt signals for the host processor and having a op-code generator for generating the op-code signals for the arithmetic unit to select RSA or ECC operations and to synchronize the timing discrepancy of heterogeneous processing.       
 
         [0027]    Further aspects of the invention will become apparent from the following description, which is given by way of example only. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0028]    Embodiments of the invention will now be described by way of example only and with reference to the accompanying drawings in which: 
           [0029]      FIG. 1  is a block diagram of a compact crypto-engine for asymmetric cryptographic processing according to the invention, 
           [0030]      FIG. 2  is a block diagram of a modular arithmetic unit, 
           [0031]      FIG. 3  is a block diagram of an interface control unit, 
           [0032]      FIG. 4  is a block diagram of Static Random Access Memory (SRAM) Block, 
           [0033]      FIG. 5  is a block diagram of a modular multiplication unit, 
           [0034]      FIG. 6  is a block diagram of a processor element, 
           [0035]      FIG. 7  is a flow diagram of RSA implementation example using polling mode, and 
           [0036]      FIG. 8  is a flow diagram of an RSA implementation example using interrupt mode. 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0037]    In the invention a common architecture platform for the two algorithms, RSA and ECC, whose inputs are taken in two different forms, is used to manipulate the two asymmetric encryption algorithms. In the preferred embodiment the combining function is restricted to the computational engine, i.e. modular manipulation. This relies heavily on the low-bit, say 8 bit, processor software to complete the design. Thus, three design considerations must are taken into account. These considerations are: 
         [0038]    1) hardware optimization for both RSA and ECC implementation with the best speed/resource trade off, 
         [0039]    2) the amount of design/module reuse and hardware sharing of the two protocols, and 
         [0040]    3) the asynchronous executing of the hardware modules in much higher speed than the processor communicating with it, i.e. heterogeneous processing. 
         [0041]    The preferred embodiment of the present invention provides a compact crypto-engine capable of executing asymmetric cryptographic algorithms including both RSA and ECC protocols and has heterogeneous computation ability running at a higher internal clock speed. 
         [0042]    Referring to  FIG. 1 , the preferred embodiment of a compact crypto-engine  10  comprises a Modular Arithmetic Unit (MAU)  11  and an Interface Control Unit (ICU)  12 . The inputs and outputs of the ICU are provided from/to a host processor (not shown) such as a personal, network computer or Digital Signal Processor. The host processor provides an 8-bit ‘data’ transput (input and output) to and from ICU  12 , and 8-bit ‘key’ and operation code (‘opcode’) inputs to ICU  12 . The ICU  12  has an 8-bit ‘status’ and a 1-bit ‘interrupt’ output to signal the host processor. Communication between the ICU  12  and MAU  11  comprises a k-bit ‘data_in’ and a 8-bit ‘modular_opcode’ signals from the ICU  12  to the MAU  11 , and a k-bit ‘data_out’ and a 8-bit ‘status_out’ signals from the MAU  11  to the ICU  12 . 
         [0043]    Referring to  FIG. 2 , the MAU  11  comprises an SRAM Block  13 , a Controller  14 , a Modular Multiplication Unit (MMU)  15 , a Modular Addition Unit (MADU)  16  and a Sign Inversion Unit (SIU)  17 . The outputs k-bit ‘data_in’ of ICU  12 , k-bit ‘temp_data’ of MMU  15 /MADU  16 /SIU  17 , 4-bit ‘address’ and 4-bit ‘control 1 ’ of Controller  14  go into SRAM Block  13 . The output k-bit ‘a/b 1 /b 2 /n 1 /n 2 ’ of SRAM Block  13  goes to MMU  15 . The output k-bit ‘a/b 1 /n 1 ’ of SRAM Block  13  goes to MADU  16 . The output k-bit ‘b 1 ’ of SRAM Block  13  goes to SIU  17 . 
         [0044]    The outputs 8-bit ‘modular_opcode’ of ICU  12  and k-bit ‘temp_data’ of MMU  15 /MADU  16 /SIU  17  go to Controller  14 . The outputs 4-bit ‘address/control 1 ’ of Controller  14  goes to SRAM Block  13 . The output 6-bit ‘control 2 ’ goes to MMU  15 . The output 3-bit ‘control 3 ’ of Controller  14  goes to MADU  16 . The output 3-bit ‘control 4 ’ of Controller  14  goes to SIU  17 . The 8-bit ‘status_out’ of Controller  14  goes to ICU  12 . The outputs k-bit ‘a/b 1 /b 2 /n 1 /n 2 ’ of SRAM Block  13  and 6-bit ‘control 2 ’ of Controller  14  go to MMU  15 . The output k-bit ‘data_out’ of MMU  15  goes to ICU  12  and the output k-bit ‘temp_data’ of MMU  15  goes to SRAM Block  13  and Controller  14 . 
         [0045]    The outputs k-bit ‘a/b 1 /n 1 ’ of SRAM Block  13  and 3-bit ‘control 3 ’ of Controller  14  go to MADU  16 . The output k-bit ‘temp_data’ of MADU  16  go to SRAM Block  13  and Controller  14 . The outputs k-bit ‘b 1 ’ of SRAM Block  13  and 3-bit ‘control 4 ’ of Controller  14  go to SIU  17 . The output k-bit ‘temp_data’ of SIU  17  goes to SRAM Block  13  and Controller  14 . 
         [0046]    Referring to  FIG. 3 , the Interface Control Unit  11  comprises a Bus Interface Unit (BIU)  18 , a Concatenation/Split Unit (CSU)  19  and a Modular-opcode Generator (MOG)  20  embedded into a Cryptographic Controller (CrC)  21 . The 8-bit transput (input and output) ‘data’ of buffer BDATA in BIU  18  is provided to the host processor. The 8-bit outputs ‘opcode’ and ‘key’ from the host processor are provided to the buffer BOPCODE and BKEY respectively in the BIU  18 . The 8-bit output ‘status’ and 1-bit output ‘interrupt’ of BSTATUS and BINTERRUPT in BIU  18  respectively are provided to the host processor. In the preferred embodiment, the ICU provides buffers to handle heterogeneous operation and the ‘interrupt’ signal to synchronize the data exchange. This allows the crypto-engine  10  to operate at a different clock speed to the host processor. 
         [0047]    The 8-bit transput ‘Tdata’ of Buffer BDATA in BIU  18  is provided to the Concatenation/Split Unit  19 . The 8-bit outputs ‘Topc’ and ‘Tkey’ of buffer BOPCODE and BKEY respectively in the BIU  18  are provided to the Modular-opcode Generator (MOG)  20  inside Cryptographic Controller (CrC)  21 . The outputs 8-bit ‘Tsta’ and 1-bit ‘Tint’ generated from the ‘status_out’ signal in the CrC  21  are provided to the BIU  18 . The k-bit output ‘data_in’ of Concatenation/Split Unit (CSU)  19 , generated by cascading a sequence of 8-bit ‘Tdata’, is provided to MAU  11 . The k-bit output ‘data_out’ of MAU  11 , converted to a sequence of 8-bit ‘Tdata’, is provided to Concatenation/Split Unit (CSU)  19 . The 8-bit output ‘module_opcode’ of MOG  20 , generated from signals ‘Topc’ and ‘Tkey’, is provided to MAU  11 . The 8-bit output ‘status_out’ of MAU  11  is provided to CrC  21  to generate the 8-bit ‘Tsta’ and 1-bit ‘Tint’ signals. 
         [0048]    Referring to  FIG. 4 , the Static Random Access Memory (SRAM) block  13  comprises an Address Decoder  22 , a plurality of switches MUX0  23  and MUX1/MUX 2 /MUX 3 /MUX 4 /MUX 5   25 , a plurality of memory blocks  24  comprising one 16×k-bit SRAM0 and four 8×k-bit SRAM 1 /SRAM 2 /SRAM 3 /SRAM 4 /SRAM 5 . In the preferred embodiment there are a total of 3×1024-bit SRAM blocks to store the 5 parameters ‘a/b 1 /n 1 /b 2 /n 2 ’ for 1024-bit RSA modular multiplication in various stages or to store 192-bit ECC temporary data. The gate counts required for storing of interim manipulation results are substantially reduced. 
         [0049]    To ameliorate the overflow problems that may be encountered during the modular multiplication calculation in MMU  15 , a memory-size-expansion approach is adopted with according to the memory block size provided by Integrated Circuit fabrication supplier, say a 1152-bit memory for a 1024-bit manipulation. 
         [0050]    Another preferred approach to overcome the overflow problem is to provide an “overflow control unit” with additional one bit for checking, say 1025-bit memory for 1024-bit manipulation. 
         [0051]    Still referring to  FIG. 4 , the 4-bit outputs ‘address’ and ‘control 1 ’ of Controller  14  are provided to Address Decoder  22  to generate one 16-bit ‘address_select[ 0 : 15 ’] output, one 10-bit ‘control_select[ 0 : 9 ]’ output and one 6-bit ‘mux_select[ 0 : 5 ]’ output. The output first bit ‘mux_select[ 0 ]’ of Address Decoder  22  is provided to switch MUX0  23  to select either k-bit ‘data_in’ outputted by ICU  12  or k-bit ‘temp_data’ outputted by MMU  15 /MAU  16 /SIU  17 . The outputs k-bit ‘data_in 0 ’, ‘data_in 1 ’, ‘data_in 2 ’, ‘data_in 3 ’, and ‘data_in 4 ’ of MUX0  23  are provided to SRAM0, SRAM 1 , SRAM 2 , SRAM 3  and SRAM 4   24  respectively. 
         [0052]    The output 3-bit address_select[ 0 : 3 ], address_select[ 4 : 6 ], address_select [ 7 : 9 ], address_select [ 10 : 12 ] and address_select[ 13 : 15 ] of Address Decoder  22  is provided to SRAM0, SRAM 1 , SRAM 2 , SRAM 3  and SRAM 4   24  respectively. The output 2-bit control_select[ 0 : 1 ], control_select[ 2 : 3 ], control_select [ 4 : 5 ], control_select [ 6 : 7 ] and control_select[ 8 : 9 ] of Address Decoder  22  are provided to SRAM0, SRAM 1 , SRAM 2 , SRAM 3  and SRAM 4   24  respectively. 
         [0053]    SRAM0, SRAM 1 , SRAM 2 , SRAM 3  and SRAM 4  receive respective signals ‘address_select[ 0 : 15 ]’, ‘data 13  in 0 ’/‘data 13  in 1 ’/‘data_in 2 ’/‘data_in 3 ’/‘data_in 4  and ‘control_select[ 0 : 9 ]’ to generate respective k-bit outputs ‘data_out 0 ’, ‘data_out 1 ’, ‘data_out 2 ’, ‘data_out 3 ’ and ‘data_out 4 ’. 
         [0054]    The 1-bit outputs ‘mux_select[ 1 ]’, ‘mux_select[ 2 ]’, ‘mux_select[ 3 ]’, ‘mux_select[ 4 ]’ and ‘mux_select[ 5 ]’ of Address Decoder  22  control switches  25  to select between MUX1 inputs ‘data_out 0 ’ or ‘b 1 ’, MUX 2  and MUX 3  inputs ‘data_out 1 ’ or ‘data_out2’ and MUX 4  and MUX 5  inputs ‘data_out 3 ’ or ‘data_out 4 ’. 
         [0055]    Referring to  FIG. 2 , the k-bit outputs ‘a’, ‘b 1 ’, ‘b 2 ’, ‘n 1 ’ and ‘n 2 ’ of switches  25  are provided to MMU  15 ; outputs ‘a’, ‘b 1 ’ and ‘n 1 ’ are provided to MAU  16 ; and output ‘b 1 ’ is provided to SIU  17 . 
         [0056]    Referring to  FIG. 5 , the Modular Multiplication Unit MMU  15  comprises a pair of Process Elements PE1  26  and PE 2  link up with a Flop-flip (FF), a Register  27 , a Shift Register  28 , a First in First Out Flip-flop (FIFO)  29  and a Control Line Element (CLE)  30 . The 6-bit output ‘control 2  ’ of Controller  14  is provided to Control Line Element  30  and is decoded into a plurality of outputs ‘load_control’, ‘load_shift_control’, ‘load_a_control 1 ’ (PE1) and ‘load_a_control 2 ’ (PE 2 ). 
         [0057]    The k-bit output ‘a’ of SRAM Block  13  is provided to Register  27 . The k-bit output ‘data_out’ of Register  27  is provided to Shift Register  28  and to ICU  12  when the output ‘load_control’ of CLE  30  is set. 
         [0058]    The 1-bit outputs ‘a i ’ and ‘a i+ 1’ of Shift Register  28  are provided to Process Element 1 (PE1)  26  and Process Element  2  (PE 2 ) respectively when the output ‘load_shift_control’ of CLE  30  is set. 
         [0059]    In the preferred embodiment the interim data ‘u_out’ and ‘u_carry_out’ are included with (k+1)-bit instead of normal (2+k)-bit for logic gate size (physical hardware size) reduction and the FIFO  29  is used as a delay line for the inputs k-bit ‘u_out’ and 1-bit ‘u_carry_out’ of PE 2  to provide the inputs k-bit ‘u_in’ and 1-bit ‘u_carry’ of PE1. The k-bit output ‘u_in’ of FIFO  29  is provided to a Flip-flop (FF 1 ) and the k-bit output ‘temp_data’ of FF 1  is provided to SRAM Block  13 . 
         [0060]    The k-bit outputs ‘b 1 ’ and ‘n 1 ’ of SRAM Block  13 , the outputs k-bit ‘u_in’ and 1-bit ‘u_carry’ of FIFO  29 , the output ‘a i ’ of Shift Register  28  and the outputs 1-bit ‘load_a_control 1 ’ (PE1) of CLE  30  are provided to Process Element 1 (PE1) to generate the outputs k-bit ‘u_out 0 ’ and 1-bit ‘u_carry 0 ’. The outputs k-bit ‘u_out 0 ’ and 1-bit ‘u_carry 0 ’ are provided to Flip-flop (FF 2 ) to generate the outputs k-bit ‘u_out 1 ’ and 1-bit ‘u_carry 1 ’. 
         [0061]    The k-bit outputs ‘b 2 ’ and ‘n 2 ’ of SRAM Block  13 , the outputs k-bit ‘u_out 1 ’ and 1-bit ‘u_carry 1 ’ of Flip-flop (FF 2 ), the output ‘a i+1 ’ of Shift Register  28  and the outputs 1-bit ‘load_a_control 2 ’ of CLE  30  are provided to Process Element  2  (PE 2 ) to generate the outputs k-bit ‘u_out’ and 1-bit ‘u_carry_out’. The outputs k-bit ‘u_out’ and 1-bit ‘u_carry_out’ are provided to FIFO  29  to generate the outputs k-bit ‘u_in’ and 1-bit ‘u_carry’. 
         [0062]    Referring to  FIG. 6 , the processor elements (PEs) implement Montgomery&#39;s multiplication to generate the modular multiplication. By defining 
         [0000]    
       
         
           
             
               A 
               = 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     0 
                   
                   
                     m 
                     - 
                     1 
                   
                 
                  
                 
                     
                 
                  
                 
                   
                     a 
                     i 
                   
                    
                   
                     2 
                     i 
                   
                 
               
             
             , 
             
               
                 B 
                 = 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       0 
                     
                     
                       m 
                       - 
                       1 
                     
                   
                    
                   
                       
                   
                    
                   
                     
                       b 
                       i 
                     
                      
                     
                       2 
                       i 
                     
                   
                 
               
               ; 
               
                 N 
                 = 
                 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       
                         m 
                         - 
                         1 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         n 
                         i 
                       
                        
                       
                         2 
                         i 
                       
                        
                       
                           
                       
                        
                       and 
                        
                       
                           
                       
                        
                       U 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       
                         m 
                         - 
                         1 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         u 
                         i 
                       
                        
                       
                         2 
                         i 
                       
                     
                   
                 
               
             
           
         
       
     
         [0000]    as the multiplier, multiplicand, modulo and modular product (result) respectively, for m bit integers where {a i ,b i ,n i ,u i }∈{0,1}, the basic algorithm for Montgomery&#39;s multiplication is given as follows: 
         [0000]    
       
         
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 Module PE(A,B,U,N,m) 
               
               
                   
                 {U −1  := 0; 
               
               
                   
                 for i = 0 to m do 
               
               
                   
                   q i  := (U i−1  + a i  B) mod 2; //LSB of U i−1  = u 0,i−1   
               
               
                   
                   U i  := (U i−1  + q i N + a i B) div 2 
               
               
                   
                 endfor 
               
               
                   
                 return U m   
               
               
                   
                 } 
               
               
                   
                   
               
             
          
         
       
     
         [0063]    In order to optimize the Process Element (PE) sizes for a compact hardware implementation, instead of full m-size PE elements, k-size (where m=e×k) PE pairs are included and parameters A j , B j , N j  and U j  are included where 
         [0000]    
       
         
           
             
               A 
               = 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     0 
                   
                   
                     e 
                     - 
                     1 
                   
                 
                  
                 
                     
                 
                  
                 
                   A 
                   j 
                 
               
             
             , 
             
               B 
               = 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     0 
                   
                   
                     e 
                     - 
                     1 
                   
                 
                  
                 
                   B 
                   j 
                 
               
             
             , 
             
               N 
               = 
               
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       0 
                     
                     
                       e 
                       - 
                       1 
                     
                   
                    
                   
                     
                       N 
                       j 
                     
                      
                     
                         
                     
                      
                     and 
                      
                     
                         
                     
                      
                     U 
                   
                 
                 = 
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       0 
                     
                     
                       e 
                       - 
                       1 
                     
                   
                    
                   
                     
                       U 
                       j 
                     
                     . 
                   
                 
               
             
           
         
       
     
         [0064]    The algorithm is modified into: 
         [0000]    
       
         
               
             
           
               
                   
               
             
             
               
                 //where superscripts = blocks, subscripts = bits and for 
               
               
                 U i−1  = u 0,i−1 , 0 is the first outer-loop. 
               
               
                   Module PE(A,B,U, N, m) 
               
               
                   {U −1  := 0; 
               
               
                    for i = 0 to m do 
               
               
                   // q i  is implemented using MUX6 39 and CSA 34 
               
               
                     q i  := u 0,i−1  + a i b 0 ; 
               
               
                     (u_carry,U i   0 ) = a i B 0  + U i−1   0 ; //implemented using CSA 34 
               
               
                     (u_carry,U i   0 ) = U i   0  + q i N 0  + u_carry; 
               
               
                     for j = 1 to e−1 do 
               
               
                 // perform  (u_carry,U i   j ) = a i B j  + U i−1   j  + q i N j  + u_carry; 
               
               
                 //implement using CSA 34, i.e. U i   j  = (a i  &amp; B j ) ⊕ U i−1   j  ⊕ u_carry 
               
               
                 // u_carry = (a i  &amp; B j  &amp; u_carry)|(U i−1   j  &amp; u_carry)|(a i  &amp; B j  &amp; U i−1   j ) 
               
               
                 // results store as (cab&#39;s, uab&#39;s) 
               
               
                       (u_carry,U i   j ) = a i B j  + U i−1   j  + u_carry; 
               
               
                 //implement using CSA 35, i.e. U i   j  = (q i  &amp; N j ) ⊕ U i   j  ⊕ u_carry 
               
               
                 // u_carry = (q i  &amp; N j  &amp; u_carry)|(U i   j  &amp; u_carry)|(q i  &amp; N j  &amp; U i   j ) 
               
               
                 // results store as (cnq&#39;s, unq&#39;s) 
               
               
                       (u_carry,U i   j ) = U i   j  + q i N j  + u_carry; 
               
               
                 // concatenate the LSB of U j  to MSB of U j−1  as carry &amp; 
               
               
                 // U i   j−1  := U i   j−1  div2, implement using CLAs 32 and 40 
               
               
                 // results store as (u_carry_out, u_out) 
               
               
                       U i   j−1  := (u 0,i   j ,U k−1...1   j−1 ); 
               
               
                   endfor 
               
               
                   U i   (e−1)  := (u_carry,U k−1Λ1   (e−1) ) 
               
               
                   endfor 
               
               
                   Return U m   
               
               
                   } 
               
               
                   
               
             
          
         
       
     
         [0065]    In the preferred embodiment the Process Element  26  and the modified algorithm include a k-bit Carry Look-ahead Adder (CLA)  31 , a (k−1)-bit CLA  32 , a plurality of AND gates  33 , a plurality of Carry Save Adders (CSA) level 1  34  and level 2  35 , a plurality of Flip-flops  36 , a (k−1)-bit Flip-flop  37 , registers  38 , a Multiplexer MUX6  39  and a single CLA  40 . 
         [0066]    The outputs k-bit ‘u_in’ and 1-bit ‘u_carry’ of FIFO  29  are provided to a k-bit CLA  31  of Process Element 1 (PE1)  26 . For Process Element  2  (PE 2 ), the outputs k-bit ‘u_out 1 ’ and 1-bit ‘u_carry 1 ’ are provided to a k-bit CLA  31 . The outputs k-bit ‘b’ (b 1  or b 2 ) of SRAM Block  13  and k-bit ‘a_out’ of Register1 are provided bitwise to a plurality of two-input AND gates  33 . The outputs k-bit ‘u[ 0 :k−1]’ of k-bit CLA  31 , 1-bit ‘u_carry’ of FIFO  29  and ‘ab[ 0 :k−1] ’of AND gates  33  are provided to level 1 CSA  34  to generate a plurality of add results ‘uab( 0 :k−1) ’ and carry ‘cab[ 0 :k−1]’. 
         [0067]    The outputs 1-bit ‘q’ of MUX6 and k-bit ‘n’ (n 1  or n 2 ) of SRAM Block  13  are provided to a plurality of AND gates to generate a k-bit output ‘nq[ 0 :k−1]’. The outputs k-bit ‘nq[ 0 :k−1]’ of a plurality of AND gates  33 , k-bit ‘uab[ 0 :k−1]’ and k-bit ‘cab[ 0 :k−1]’ are provided to level 2 CSA  35  bitwise to generate a plurality of add results ‘unq[ 0 :k−1]’ and carry ‘cnq[ 0 :k−1]’. Preferably, the output ‘cab[k−1]’ goes through a Flip-flop (FF 3 ) to bit- 0  (of level 2) CSA  35 . 
         [0068]    The outputs k-bit ‘unq[ 0 :k−1]’ and ‘cnq[ 0 :k−1]’ of a plurality of CSAs  35  are provided to a (k−1)-bit CLA  32  and 1-bit CLA  40  to generate the outputs k-bit ‘u_out’ and 1-bit ‘u_carry_out’. Preferably, the output ‘cnq(k−1)’ of CSA goes through a Flip-flop (FF 4 ) to CLA  40  and the output is carry of (k−1)-bit CLA  32  goes through a Flip-flop (FF 5 )  36  to CLA  40 . Preferably, the outputs of (k−1)-bit CLA  32  go through a plurality of Flip-flops (FF6)  37  to generate the outputs ‘u_out[ 0 :k−2]’ of ‘u_out’. 
         [0069]    The outputs ‘uab[ 0 ]’ of bit-0 CSA  34  and 1-bit delayed ‘uab[ 0 ]’ of Register1  38  are provided to MUX6  39  to give output ‘q’ according to condition of an output ‘load_a’ of CLE  30 . The output ‘q’ of Register1  38  is generated according to the outputs ‘uab[ 0 ]’ of bit- 0  CSA  34  and delayed ‘load_a’ from Register3 of CLE  30 . 
         [0070]    The outputs 1-bit ‘load_a’ of CLE  30  and 1-bit ‘a’ of Shift Register  28  are provided to Register2 to generate an output of 1-bit ‘a_out’. 
         [0071]    Embodiments of the invention have been implemented using 0.35 μm semiconductor technology. A total gate count of 15K for RSA and 20K for both RSA and ECC was utilized for k=64. The benchmark testing for a 1024 (1024-bit) RSA is summarized in Table 1 as follows with an internal clock of 22 MHz. 
         [0000]    
       
         
               
             
               
               
               
               
               
             
               
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Performance of various RSA operations 
               
             
          
           
               
                   
                 No. of 
                 No. of 
                   
                 Computation 
               
               
                 Exponent 
                 ‘1’s 
                 ‘0’s 
                 Modulus 
                 time 
               
               
                   
               
             
          
           
               
                  17 bit 1   
                 2 
                 15 
                 1024 bit 
                  7 ms 
               
               
                 1024 bit 2   
                 512 
                 512 
                 1024 bit 
                 607 ms 
               
               
                   
               
               
                   1 The public key e = 2 16  + 1 = 65537 is used. 
               
               
                   2 Average case, 1024-bit exponent, 50% ‘1’, 50% ‘0’ in binary representation. 
               
             
          
         
       
     
         [0072]    The benchmark device is capable of running at 100 MHz where the computational time can be reduced to 0.18 seconds for the worst case scenario. 
         [0073]    With the heterogeneous computation ability, the process can be executed in a much higher clock rate using phase lock clock multiplier to allow faster computational and thus transaction time. 
         [0074]    A implementation example of an RSA coprocessor is based on four special function registers (SFRs) RSAD, RSAO, RSAS and RSAK in a host processor for controlling and monitoring the RSA coprocessor. A brief description of the SFRs now follows: 
       RSA DATA (RSAD) 
       [0075]      
         [0000]    
       
         
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
             
           
               
                   
               
               
                 Bit: 
                 7 
                 6 
                 5 
                 4 
                 3 
                 2 
                 1 
                 0 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 RSAD. 7 
                 RSAD. 6 
                 RSAD. 5 
                 RSAD. 4 
                 RSAD. 3 
                 RSAD. 2 
                 RSAD. 1 
                 RSAD. 0 
               
               
                   
                   
               
             
          
         
       
     
         [0076]    The bi-directional SFR is accessed via a mnemonic RSAD. Depending on the SFR RSAS, CPU and RSA coprocessor read from and write to this register. Data X, N and M are written at the beginning by software while Data M is read is at the end by hardware. The RSAD is reset to 00h by a reset. There is unrestricted read/write access to this SFR. 
       RSA OPCODE (RSAO) 
       [0077]      
         [0000]    
       
         
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
             
           
               
                   
               
               
                 Bit: 
                 7 
                 6 
                 5 
                 4 
                 3 
                 2 
                 1 
                 0 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 — 
                 — 
                 KEND 
                 RST 
                 WX 
                 WN 
                 RWM 
                 RW 
               
               
                   
                   
               
             
          
         
       
     
         [0078]    The RSA Opcode Register with mnemonic RSAO receives instructions to configure the operation of the RSA coprocessor. This byte is set or cleared by software for the following purpose.
   KEND Key End: This bit is set to tell the coprocessor the key writing is finished.   RST Reset: This bit is set to reset the coprocessor synchronously.   Wx Write Precomputation Constant X: When this bit and RW are set, 128 bytes of data X are written into the coprocessor. When this bit is cleared, data X will not be written.
 
WN Write Modulus N: When this bit and RW are set, 128 bytes of data N are written into the coprocessor. When this bit is cleared, data N will not be written.
   RWM Read Write Message M: When this bit and RW are set, 128 bytes of data M are written into the coprocessor. When this bit is set while RW is cleared, 128 bytes of data M are read from the coprocessor. When this bit is cleared, data M will not be read or written.   
 
         [0083]    RW Read Write Control: When this bit is set, data X, N, M will be written depends on bits WX, WN, RWM. When cleared, 128 bytes of data M are read from the coprocessor if RWM is set. 
         [0084]    All possible combination of read/write operation: 
         [0000]    
       
         
               
               
               
               
               
               
             
           
               
                   
                   
               
               
                   
                 WX 
                 WN 
                 RWM 
                 RW 
                 Read/Write Operation 
               
               
                   
                   
               
             
             
               
                   
                 1 
                 0 
                 0 
                 1 
                 Write data X 
               
               
                   
                 0 
                 1 
                 0 
                 1 
                 Write data N 
               
               
                   
                 0 
                 0 
                 1 
                 1 
                 Write data M 
               
               
                   
                 1 
                 1 
                 0 
                 1 
                 Write data X and N 
               
               
                   
                 1 
                 0 
                 1 
                 1 
                 Write data X and M 
               
               
                   
                 0 
                 1 
                 1 
                 1 
                 Write data N and M 
               
               
                   
                 1 
                 1 
                 1 
                 1 
                 Write data X, N and M 
               
               
                   
                 X 
                 X 
                 1 
                 0 
                 Read data M 
               
               
                   
                 X 
                 X 
                 0 
                 0 
                 No operation 
               
               
                   
                 0 
                 0 
                 0 
                 X 
                 No operation 
               
               
                   
                   
               
             
          
         
       
     
         [0085]    The RSAO is reset to 00h by a reset. There is unrestricted read/write access to this SFR. 
       RSA STATUS (RSAS) 
       [0086]      
         [0000]    
       
         
               
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
             
           
               
                   
                   
               
               
                   
                 Bit: 
                 7 
                 6 
                 5 
                 4 
                 3 
                 2 
                 1 
                 0 
               
               
                   
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 — 
                 — 
                 — 
                 — 
                 WKR 
                 — 
                 RMR 
                 — 
               
               
                   
                   
               
             
          
         
       
     
         [0087]    The status with mnemonic RSAS of the RSA coprocessor is expected to shown in the RSA Status Register. This byte is set or clear by hardware for the following purpose.
   WKR Write Key Request: This bit is set to request the CPU to write the next byte of key to the SFR RSAK.   RMR Read Message Request: This bit is set to tell the CPU that the RSA operation is finish and it is ready to read the data M. It also requests the CPU to write instruction to read data M from RSAD.   
 
         [0090]    The RSAS is reset to 00h by a reset. 
         [0091]    There is restricted read only access to this SFR. 
       RSA KEY (RSAK) 
       [0092]      
         [0000]    
       
         
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
             
           
               
                   
               
               
                 Bit: 
                 7 
                 6 
                 5 
                 4 
                 3 
                 2 
                 1 
                 0 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 RSAK. 7 
                 RSAK. 6 
                 RSAK. 5 
                 RSAK. 4 
                 RSAK. 3 
                 RSAK. 2 
                 RSAK. 1 
                 RSAK. 0 
               
               
                   
                   
               
             
          
         
       
     
         [0093]    The SFR with mnemonic RSAK will be used to store the key. One byte of RSA key, i.e. the exponent e or d is written into this register by software, while the bit WKR of the SFR RSAS is set. The RSAK is reset to 00h by a reset. There is unrestricted read/write access to this SFR. 
         [0094]    The procedure of control the RSA coprocessor to carry out a RSA operation is summarized in  FIGS. 7 and 8 . The sequence of operation is as follows: 
         [0095]    1. The coprocessor must be reset at the beginning of RSA operation; the Reset (RST) bit is set (RSAO=10h) and cleared (RSAO=00h) to reset the coprocessor. 
         [0096]    2. Two bytes of RSA key are then written to RSAK, starting from the most significant byte. 
         [0097]    3. If the key ends, i.e. the key is less than or equal to 2 bytes, set the bit KEND of RSAO (RSAO=20h) to inform the coprocessor. 
         [0098]    4. Set the Write operation by setting appropriate bits in RSAO, followed by writing the data block(s) in the order of data X, N and M into RSAD, starting from the least significant byte of first data block. For example, if RSAO=0Fh, 3×128 bytes of data X, N, and M are written to RSAD sequentially, starting from the least significant byte of data X; If RSAO=0Bh, 2×128 bytes of data X and M are written to RSAD sequentially, starting from the least significant byte of data X; If RSAO=09h, only 128 bytes of data X is written to RSAD, starting from the least significant byte of data X. 
         [0099]    5. Check the WKR of RSAS to see whether the RSA coprocessor request next byte of key. 
         [0100]    6. If the WKR is set, write one byte of key to RSAK. 
         [0101]    7. If the key ends, i.e. all bytes of key is written into RSAK, set the bit KEND of RSAO (RSAO=20h) to inform the coprocessor. 
         [0102]    8. Check the RMR to see whether the result data is ready to be read. 
         [0103]    9. When it is ready to read the data, the read data M instruction is assigned to the RSAO (RSAO=02h). 128 bytes of data M are read from RSAD, starting from the least significant byte of data M. 
         [0104]    Where in the foregoing description reference has been made to methods or elements have known equivalents then such are included as if individually set forth herein. 
         [0105]    Embodiments of the invention have been described, however it is understood that variations, improvement or modifications can take place without departure from the spirit of the invention or scope of the appended claims.

Technology Category: 5