VAMPIRE	eBACS: ECRYPT Benchmarking of Cryptographic Systems	ECRYPT II

Measurements of key-encapsulation mechanisms on one machine: amd64; Bobcat (500f10); 2011 AMD G-T56N; 2 x 1650MHz; h8bobcat, supercop-20241022

[Page version: 20260217 20:24:27]

eBATS (ECRYPT Benchmarking of Asymmetric Systems) is a project to measure the performance of public-key systems. This page presents benchmark results collected in eBATS for key-encapsulation mechanisms:

• Time (cycles) to generate a key pair: a secret key and a corresponding public key.
• Time for "encapsulation": time to compute a ciphertext and corresponding session key, given a user's public key.
• Time for "decapsulation": time to compute the session key from the ciphertext, given the user's secret key.
• Space (bytes) for a secret key.
• Space for a public key.
• Space for a ciphertext.
• Space for a session key.

Each table row lists the first quartile of many speed measurements (or StQ1 starting with supercop-20260214), the median of many speed measurements (or StQ2 starting with supercop-20260214), the third quartile of many speed measurements (or StQ3 starting with supercop-20260214), and the name of the primitive. Measurements with large interquartile range (or stabilized interquartile range) are indicated in red with question marks. The symbol C: means that the current SUPERCOP database does not list IND-CCA2 security as a goal for this key-encapsulation mechanism. The symbol T: (starting with supercop-20200816) means that the SUPERCOP database at the time of benchmarking did not list constant time as a goal for this implementation. The symbol T!!! means that constant time was listed as a goal for this implementation, but that the implementation failed TIMECOP. (TIMECOP failures are not necessarily security issues; they can sometimes be resolved by, e.g., declaring that a rejection-sampling condition is safe to declassify.)

There is a separate page with more information about each key-encapsulation mechanism and each implementation. Designers and implementors interested in submitting new key-encapsulation mechanisms and new implementations of existing systems should read the call for submissions.

Test results

Graphs: old (pkcycles,pkbytes) (ccycles,cbytes) (kcycles,cbytes) (pkbytes,cbytes)

NISTPQC graphs: (pkcycles,pkbytes) (ccycles,cbytes) (kcycles,cbytes) (pkbytes,cbytes)