Datasheet

...........continued
Option Specified Maximum Modulus Size
(bytes)
Maximum Modulus Size
(bits)
Exponent in Crypto RAM, 2 bits window 504 4032
Exponent in Crypto RAM, 3 bits window 400 3200
Exponent in Crypto RAM, 4 bits window 284 2272
Exponent not in Crypto RAM, 1 bit window 672 5376
Exponent not in Crypto RAM, 2 bits window 576 4608
Exponent not in Crypto RAM, 3 bits window 448 3584
Exponent not in Crypto RAM, 4 bits window 308 2464
43.3.5.2.9 Status Returned Values
Table 43-55. ExpMod Service Return Codes
Returned Status Importance Meaning
PUKCL_OK – Service functioned correctly
43.3.5.3 Probable Prime Generation (Using Rabin-Miller)
43.3.5.3.1 Purpose
This service is used to perform probable prime generation or test. This service processes integers in
GF(p) only.
The options available for this service are:
• Choice of the number of iterations of the Rabin-Miller test
• Generation or Test of a probable prime number
• Fast Implementation
• Regular Implementation
• Exponent Window Size
43.3.5.3.2 Additional Information
The Rabin-Miller test is a probable-primality testing algorithm. As a consequence, the primality of the
generated number is not guaranteed at 100%, however, numerous publications have been issued
explaining how to estimate the probability of getting a composite number, giving the size of the number
and the number of iterations (the T parameter).
Useful information can be found in the “Handbook of Applied Cryptography (Discrete Mathematics and Its
Applications” by Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, in the following
sections:
• 4.2.3. “Rabin-Miller Test”
• 4.4. “Prime Number Generation”
43.3.5.3.3 How to Use the Service
43.3.5.3.4 Description
This service processes a test for probable primality or a generation of a probable prime number.
SAM D5x/E5x Family Data Sheet
Public Key Cryptography Controller (PUKCC)
© 2019 Microchip Technology Inc.
Datasheet
DS60001507E-page 1496