MPC8536E-ANDROID Freescale Semiconductor, MPC8536E-ANDROID Datasheet - Page 438

• Manufacturer Part Number: MPC8536E-ANDROID
• Description: HARDWARE/SOFTWARE ANDROID OS
• Manufacturer: Freescale Semiconductor
• Series: PowerQUICC ™r
• Type: MPUr

Specifications of MPC8536E-ANDROID

• Contents: Board
• For Use With/related Products: MPC8536
• Lead Free Status / RoHS Status: Lead free / RoHS Compliant

Security Engine (SEC) 3.0
Compared to RSA, elliptic curve cryptography provides greater security with smaller field sizes. For
example, an elliptic curve field size of 160 is roughly equivalent to the security provided by 1024-bit RSA.
A field size set to 224 roughly equates to 2048 bits of RSA security.
The PKEU contains routines implementing the atomic functions for elliptic curve processing, including
point arithmetic and finite field arithmetic. The point operations (multiplication, addition and doubling) all
involve one or more finite field operations which are addition, multiplication, inverse, and squaring. Point
add and double each use all four finite field operations. Similarly, point multiplication uses all elliptic
curve point operations as well as the finite field operations. All these functions are supported both in prime
fields and polynomial fields.
10.1.4.1.2
The PKEU is also capable of performing integer modulo arithmetic. This arithmetic is an integral part of
the RSA public key algorithm; however, it can also play a role in the generation of ECC digital signatures
(including ECDSA) and Diffie-Hellman key exchanges.
Modular arithmetic functions supported by the SEC’s PKEU include the following (refer to
for a complete list):
In the preceding list, the following notation is used:
The PKEU can perform modular arithmetic on operands up to 4096 bits in length. The modulus must be
larger than or equal to 33 bits (5 bytes), or an error is returned. This is not seen as a limitation since no
useful cryptographic applications exist for smaller moduli. The PKEU uses the Montgomery modular
multiplication algorithm to perform core functions. The addition and subtraction functions help support
known methods of the Chinese Remainder Theorem (CRT) for efficient implementation of the RSA
algorithm.
10.1.4.2
The DES Execution Unit (DEU) performs bulk data encryption/decryption, in compliance with the Data
Encryption Standard algorithm (NIST FIPS 46-3). The DEU can also compute 3DES, an extension of the
DES algorithm in which each 64-bit input block is processed three times. The SEC supports 2-key
(K1=K3) or 3-key 3DES.
10-8
•
•
•
•
•
•
•
•
R
(A
(A
(A + B) mod N
(A – B) mod N
N is the modulus
A and B are input parameters
R is 2
is referred to as “E” in public key descriptors)
2
mod N
B) R
B) R
Sz’(N)
Data Encryption Standard Execution Unit (DEU)
Modular Exponentiation Operations
–1
–2
, where Sz’(N) is the bit length of N rounded up to the nearest multiple of 32 (Note: R
MPC8536E PowerQUICC III Integrated Processor Reference Manual, Rev. 1
mod N
mod N
Freescale Semiconductor
Table 10-67