Footnotes

Chapter 8: The RSA Algorithm

* In number theory, Euler’s totient function, φ(n), is an arithmetic function that finds out all the co-prime numbers to n that are less than or equal to n.

Chapter 13: Symmetric Key Encryption Acceleration on Heterogeneous Many-Core Architectures

* C++ bindings are available for OpenCL versions 1.1 and 1.2.
* This is currently supported by the Intel OpenCL SDK, but not by the SDKs of other vendors.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
18.116.36.71