1 Montgomery Modular Multiplication in Hard- ware
1 Montgomery Modular Multiplication in Hard- ware
1 Montgomery Modular Multiplication in Hard- ware
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
FEI KEMT<br />
7 Research Contribution<br />
With this thesis we contributed to the field of hard<strong>ware</strong> implementation of public-key<br />
cryptographic system elements. We discussed the aspects of algorithm adaptations<br />
and system architectures for modular multiplier and cryptanalytic hard<strong>ware</strong>. Ran-<br />
domness extraction method based on clock circuitry was evaluated and new f<strong>in</strong>d<strong>in</strong>gs<br />
were presented.<br />
The research contribution were achieved <strong>in</strong> the follow<strong>in</strong>g topics:<br />
• Optimised <strong>Montgomery</strong> modular multiplier implementation <strong>in</strong> hard<strong>ware</strong>.<br />
• The elliptic curve method implementation <strong>in</strong> hard<strong>ware</strong>.<br />
• Evaluation of random number generator based on clock circuitry <strong>in</strong> FPGAs.<br />
Optimised <strong>Montgomery</strong> modular multiplier implementation <strong>in</strong> hard<strong>ware</strong><br />
Two most popular public-key cryptographic algorithms – the RSA and ECC use<br />
extensively modular operations with large numbers. The MM can be a very slow<br />
operation when performed on general-purpose computers, therefore can be acceler-<br />
ated by an effective hard<strong>ware</strong> implementation.<br />
We analysed algorithms for <strong>Montgomery</strong> MM and architectures for their effec-<br />
tive implementation suitable for reconfigurable hard<strong>ware</strong> structures. Our attention<br />
was paid to keep the scalability and parametrisation of multiplier unit also <strong>in</strong> the<br />
other parts of the system and f<strong>in</strong>d an optimal model for division of computational<br />
load between the soft<strong>ware</strong> and hard<strong>ware</strong> part of the system. The results of area oc-<br />
cupation and tim<strong>in</strong>g analysis were presented after application of hard<strong>ware</strong>-soft<strong>ware</strong><br />
co-design.<br />
The elliptic curve method implementation <strong>in</strong> hard<strong>ware</strong> The security of<br />
the most applied public-key cryptographic algorithm – RSA depends on hardness<br />
of factor<strong>in</strong>g large numbers. In the currently best known method for factor<strong>in</strong>g large<br />
<strong>in</strong>tegers – the GNFS one important step is the factorisation of mid-sized <strong>in</strong>tegers<br />
for which an ECM is an efficient algorithm.<br />
The ECM algorithm is a classical example of algorithm that can be significantly<br />
accelerated thanks to special-purpose hard<strong>ware</strong>. We provided a detailed description<br />
of efficient ECM architecture, especially suited for hard<strong>ware</strong> implementation. The<br />
modular multiplier obta<strong>in</strong>ed as a result of our research described <strong>in</strong> the previous<br />
po<strong>in</strong>t presents a core element of the ECM unit and allows fast prototyp<strong>in</strong>g. For<br />
124