Additional Sample Code for Intel® Integrated Performance Primitives Cryptography

ID 679704
Updated 7/11/2016
Version Latest



The documents attached to this article are contributed by Intel customers. These documents can be considered as addenda to the Intel® Integrated Performance Primitives (Intel® IPP) Cryptography Developer Reference, which can help to get started with the Intel IPP Cryptography library. The documents provide a short syntax description and sample codes for almost all primitives described in the Developer Reference.

The article has two documents attached: for the latest Intel IPP 9.x version and  for early 7.1 version, respectively.

We believe that the attached materials can be a valuable addition to the Developer Reference. You can find the detailed list of described primitives in the table of contents of each document. General descriptions of algorithms implemented in the Intel IPP Cryptography library can be found in several publications freely available on the web (for example: Menezes, A.J., Oorschot, P.C., Vanstone, S.A., Handbook of Applied Cryptography, CRC Press, 2001, You can find the corresponding web page addresses in the bibliography section at the end of the attached documents.

Since the best possible compilation method for Intel IPP code depends on several factors, we recommend the simplest compilation method for the provided examples. Unfortunately, this approach may lead to a performance degradation, so in some examples (e.g. page 229 of intelcrypt710.pdf) we explain how to obtain faster executable. The described method has been tested on the Linux* OS version of the Intel IPP library only, so the compilation hints are restricted to this version.

For general information on library compilation, refer to the Intel IPP Developer Guide available at

Andrzej Chrzeszczyk is Associate Professor of Mathematics at Jan Kochanowski University, Kielce Poland. email:
Jakub Chrzeszczyk holds MSc in Computer Science. He is currently GeoNet Systems Administrator at GNS Science, New Zealand. email: