Questions tagged [performance]

Performance defines the abilities of a cipher in terms of processing throughput on various platforms, including its memory requirements.

Filter by
Sorted by
Tagged with
28 votes
3 answers
7k views

How is bitslicing faster?

I have read a paper on Bit Slicing and Lightweight crypto but cannot understand how bitslicing makes encryption scheme faster. Please can someone explain with an example exactly how bit slicing makes ...
ishaan arora's user avatar
19 votes
1 answer
5k views

What are the benefits of lattice based cryptography?

Previously we visited the benefits of elliptic curves for cryptography. Lattice based cryptography is starting to become quite popular in academia. The primary benefit of lattice based crypto is the ...
mikeazo's user avatar
  • 38.6k
16 votes
2 answers
5k views

How do I get the equivalent strength of an ECC key?

I know how to calculate the comparable symmetric strength of an RSA modulus: calculate the running time for a field sieve. This is how NIST gives approximate symmetric sizes for asymmetric algos in ...
mikemaccana's user avatar
15 votes
2 answers
2k views

Is it possible to utilize an AES-128 encryption hardware unit for AES-256?

There exist processors (for example ARM v8/v9 archicteture based), which cannot do AES-256 hardware based, but are equipped with AES-128 encryption hardware units. Is it possible to utilize an AES-...
0laf's user avatar
  • 153
11 votes
2 answers
6k views

How does hash speed vary based on string length?

Surprisingly I have not been able to find an answer to this question on Google. If I have a function that is based on any of the popular hashing algorithms used for password generation, by what ...
NibblyPig's user avatar
  • 213
11 votes
3 answers
5k views

Accelerating SHA-1

I have a program where computing SHA-1 is the bottleneck. This is using OpenSSL 1.0.0e on a 2.6Ghz 16-core Opteron where I get about 325MiB/s throughput. (SHA1 here is via Andy Polyakov's x86-64 ...
Fixee's user avatar
  • 4,158
11 votes
1 answer
603 views

Secure content-defined chunking

Intro For deduplication purposes, I need to split a stream of plaintext bytes into variable-sized chunks. The way this is traditionally done is using a rolling hash function defined over some window $...
Paya's user avatar
  • 189
10 votes
1 answer
764 views

Can reduced-round ChaCha be used as non-cryptographic fast PRNG to produce output indistinguishable from random data?

The fastest known attack against the Salsa20 family of stream ciphers requires 2137 simple operations against Salsa20/7, or 2244 against Salsa20/8. The 8-round version encrypts data at 1.88 cycles-per-...
forest's user avatar
  • 15.3k
10 votes
1 answer
3k views

Performance of ECDSA, ECKCDSA and ECGDSA

It is proven that ECDSA algorithms are faster in key and signature generation compared to RSA. In addition, the signatures are much shorter. However, I would like to know the performance difference ...
budderick's user avatar
  • 425
9 votes
4 answers
4k views

Lightweight cipher using only 8-bit operations

What is the most efficient (in cycles per byte) cryptographically secure symmetric cipher to implement using only 8-bit operations? Algorithms like TEA are great for embedded devices, but it is ...
forest's user avatar
  • 15.3k
9 votes
1 answer
11k views

How do RSA and ECDSA differ in signing performance?

Signature algorithms with elliptic curves have smaller output sizes compared to RSA for the same level of security. What about the processing time to generate a signature ? I've seen figures giving ...
Dingo13's user avatar
  • 2,867
9 votes
1 answer
10k views

How to calculate time taken by encryption?

First of all, I know that this all it's very complicated, I know that CPUs are complex beasts, and may not work at their full potential all the time, they can have more than one core, and the ...
yak's user avatar
  • 233
9 votes
1 answer
8k views

Elliptic Curve SSL performance: ECDHE and/or ECDSA?

I have a question about the performance benefits (in terms of server-side CPU load) of ECC (Elliptic Curve cryptography) cipher suites in SSL/TLS. It is a known fact that ECC is very good for ...
RandomTask's user avatar
9 votes
0 answers
2k views

Comparison of SNARK-friendly hash algorithms MiMC7, Poseidon, Pederson?

There are some cryptographically secure hash algorithms designed to be efficient for SNARKs, STARKs and FHE. Some of them already implemented in Zcash, Zokrates and circom. The ones that I know of are:...
Habib's user avatar
  • 951
8 votes
4 answers
2k views

Switching between AES and a highly performant algorithm

I want to de/encrypt several binary files rather frequently on a normally battery-powered device. My goal is to use AES-256 when the device is AC-powered and a highly performant algorithm when it's ...
Kar's user avatar
  • 473
8 votes
5 answers
7k views

AES decryption vs encryption speed

Let's consider the CTR mode. For a faster encryption/decryption, is it preferable to use the decryption operation of AES, or its encryption ?
Dingo13's user avatar
  • 2,867
7 votes
2 answers
897 views

Besides key and ciphertext sizes what are other advantages of elliptic curve versions of various protocols?

There are elliptic curve variants of Diffie-Hellman, ElGamal, DSA and possibly other protocols/algorithms. I know that these elliptic curve variants have smaller key and ciphertext sizes which will ...
mikeazo's user avatar
  • 38.6k
7 votes
1 answer
2k views

What does a "cycle" mean in cryptography benchmarks?

In this table of the "Crypto++ 5.6.0 Benchmarks", for example, cryptographic algorithm performance is measured in cycles per byte for symmetric ciphers, and in cycles per operation for asymmetric ...
mary's user avatar
  • 1,031
7 votes
1 answer
630 views

Pseudo random generator vs block encryption, which is faster?

If one wishes to encrypt one can either use a pseudo random generator to generate a long sequence and then xor it with plaintext, similarly he can use the seed as key to encrypt the plaintext using ...
Baruntar's user avatar
  • 327
6 votes
6 answers
2k views

why XOR is recommended/Used in every paper I read for encryption and decryption stream cipher?

Stream ciphers use a deceptively simple mechanism: you combine the plaintext data, bit by bit, with “key” bits, using the exclusive or operation. Why can't I use other opeartions such as NAND, AND, ...
Bhargav - Retarded Skills's user avatar
6 votes
2 answers
4k views

Hash functions vs Stream Ciphers in terms of Speed

We know that it's possible to create a hash using a stream cipher (for instance, RC4 or AES in Counter Mode). As stated here: "A Pseudo Random Generator (PRG) and a hash function are both Pseudo ...
Aventinus's user avatar
  • 286
6 votes
0 answers
621 views

What is the fastest modular reduction algorithm available?

I have been browsing for the fastest and most efficient modular reduction algorithms and came across quite a few. But the one in A Fast Modular Reduction Method (2014) by Zhengjun Cao, Ruizhong Wei ...
abejoe's user avatar
  • 605
5 votes
3 answers
263 views

Are there encryption schemes with which it takes (significantly) longer to encrypt than to decrypt?

Are there encryption schemes with which it takes (significantly) longer to encrypt than to decrypt? I am thinking of a specific situation in which a server continuously receives encrypted messages ...
Sentry's user avatar
  • 189
5 votes
2 answers
4k views

RSA performance

I was wondering what is the performance bottleneck in RSA algorithm? Is it the size of message, calculating the modular inverse, exponentiation? Say I have a fixed value of n to encrypt and decrypt ...
Ajit's user avatar
  • 243
5 votes
2 answers
2k views

Calculating cycles per byte

Cycles per byte seems to be a critical concern in designing and choosing stream ciphers. For example, from Wikipedia, RC4 has 7 cycles/byte on original Pentium chips. How is this calculated? Do they ...
0xFE's user avatar
  • 406
5 votes
1 answer
1k views

Faster alternative to HKDF

HKDF is used in one of my projects to derive separate keys from a common master key. But profiling has shown it to be the performance bottleneck under certain circumstances. Is there any faster ...
Siyuan Ren's user avatar
5 votes
1 answer
18k views

RSA 4096 bit key benchmark

How can I benchmark RSA operations on my computer? I want to know about 4096-bit long keys on general computers. How many encryptions and decryptions are possible per second? All benchmarks I found ...
mary's user avatar
  • 1,031
5 votes
3 answers
4k views

Can a billion elliptic curve keys be generated on a laptop in less than an hour?

I want my application to generate an EC key pair. The first four bytes of the sha256 hash of the public key should contain a known IP address. As hashes are one-way functions, I need to brute force ...
Thomas Von Panom's user avatar
5 votes
3 answers
5k views

Cryptography and FPGA

I see a lot of papers about FPGA implementations. For what kind of "concrete" application should we implement cryptographic algorithms on FPGA ? Which secured application require such a huge data ...
Dingo13's user avatar
  • 2,867
5 votes
2 answers
2k views

Performance comparison between ECDSA and BLS signature schemes

I want to choose an efficient signature scheme for implementation on a lightweight MCU. I was wondering how does the performance of ECDSA and BLS signature schemes compare in terms of signing time and ...
Ihtesham Haider's user avatar
5 votes
1 answer
299 views

Is there an economic way to check if an elliptic curve point in Jacobian coordiate is the same as a compressed point

On an elliptic curve such as $y^2 = x^3 + b$, we define $a$ compressed point $P = (x, y)$ by it's coordinate $x$ and the parity of the $y$ coordinate. $y$ can be computed using $y = \pm\sqrt{x^3 + b}$ ...
deadalnix's user avatar
  • 193
5 votes
1 answer
216 views

Ideal way to profile/performance-measure cipher implementations

I have implemented a bit-sliced version of two ciphers (Gibbon-120 and Hanuman-120, both part of the Primates family of ciphers: http://primates.ae/wp-content/uploads/primatesv1.02.pdf ) I now want ...
oPolo's user avatar
  • 367
5 votes
0 answers
191 views

Efficient proof of knowledge using Carter-Wegman hash

A verifier wants to ensure, with only little exchange of data with other systems, that a large block of data $M$ that the verifier holds is also available to some other system(s). It is not an ...
fgrieu's user avatar
  • 141k
4 votes
1 answer
8k views

Is encryption time greater than decryption time?

Is encryption time always greater than decryption time for all encryption techniques (AES / DES / RSA / DSA), or is there a mistake somewhere in my implementation?
user avatar
4 votes
1 answer
1k views

How to measure Cycles per Byte of an Algorithm?

I am trying to measure the cycles per byte for $\mathop{SHA-3}$ reference implementation. I am using recommendations from Microsoft querying the performance counter. As you can see in the first ...
chris000r's user avatar
  • 519
4 votes
1 answer
385 views

Is this a good choice of a digital signature scheme?

This is a concrete instantiation of Rabin-Williams signatures. Specifically: The private key is 2 primes $p, q$. The public key is their product $N = pq$ and is approximately 3072 bits long. the ...
Demi's user avatar
  • 4,793
4 votes
1 answer
4k views

Why is 224 bit ecdsa faster than 192 bit ecdsa?

I ran several benchmarks using openssl on 2 different computers and I got a surprising result. for the Nist 192 bit curve the benchmark result is ...
Jan Moritz's user avatar
4 votes
1 answer
253 views

Benchmarks for second round CAESAR competitors

I'm interested in how the second round CAESAR competitors stack up in terms of software performance against each other and against chacha20-poly1305 with both small and large messages. Sadly the only ...
cooky451's user avatar
  • 345
4 votes
1 answer
1k views

Why inversion and multiplication operations are costly in elliptic curves?

There are several algorithms for efficient scalar multiplication of an arbitrary point P(x,y) by some positive integer k in elliptic curves defined over $F_{p}$ or $F_{2^{m}}$. The scalar ...
KMK's user avatar
  • 43
4 votes
1 answer
5k views

Exactly how slow is asymmetric encryption?

I'm currently doing a project on RSA, and have just come across this website. https://www.namecheap.com/support/knowledgebase/article.aspx/798/67/what-is-an-rsa-key-used-for On here, it says that ...
Ali's user avatar
  • 481
4 votes
1 answer
6k views

RAR brute force cracking speed

I have been playing around with cRARk and was astonished by the low speed. On a 2015 high-end GPU (GeForce 980 ti), it took roughly 4h 50min to test all passwords composed of an 8-character prefix and ...
Wojciech Sidor's user avatar
4 votes
1 answer
796 views

How can k3d3/ed25519-java's performance be improved?

I tried asking this on stackoverflow because I thought it might be a simple coding question and didn't want to clutter up this amazing stack, but I received no responses. CodesInChaos showed me that ...
user avatar
4 votes
0 answers
596 views

How to perform benchmark of block/stream ciphers? [closed]

I would like to perform some benchmarking of different block and stream ciphers for general data (lossless and lossy data) encryption and decryption (with focus on power consumption). To get general ...
Armen's user avatar
  • 173
3 votes
3 answers
7k views

What is the fastest block cipher in the (Intel) world?

In AES competition,Rijndael cipher obtained first rank and become Standard and Serpent, Twofish, RC6 and MARS obtained another ranks and I know that Serpent took second rank because it was slower than ...
user avatar
3 votes
2 answers
1k views

Performance metrices of cryptographic algorithms

I'm a beginner and working on cryptography performance metrics. My question is that what are the important metrics to check the performance of Cryptography Algorithms.
Anum's user avatar
  • 31
3 votes
2 answers
10k views

AES Algorithm processing time in Arduino vs Raspberry Pi

The Arduino employs an 8-bit ATmega series microcontroller whereas the Raspberry Pi is based around a 32-bit ARM processor, and the Arduino is typically clocked at between 8-16MHz and with 2-8kB of ...
Sufiyan Ghori's user avatar
3 votes
3 answers
1k views

Is there a floating point CSPRNG?

Is there a floating-point CSPRNG that operates, natively, using floating point operations? Looking for a CSPRNG that's very fast on GPUs, and would be hard for a CPU to beat. EDIT: Floating point ...
Erik Aronesty's user avatar
3 votes
3 answers
5k views

AES encryption takes more time to decrypt than encrypt

I am trying to find how much time an AES encryption and decryption takes for a given amount of data and key. In all the cases encryption takes way lesser processing time than decryption. I tried to ...
Bee's user avatar
  • 131
3 votes
1 answer
813 views

How does redundancy in a file effects performance and security of encryption?

Does redundancy in a file or data effect performance and security of encryption? (for example for AES, if not for general case) Is it easier to encrypt something that has high redundancy or something ...
Armen's user avatar
  • 173
3 votes
1 answer
2k views

ABE Schemes - Access Structures & Performance

I'm reading this article, CP-ABE with constant-size keys for lightweight devices and in the Table 1, are there these access structure: Threshold, Tree, ($n$,$n$)-Threshold, LSSS, AND gates. I have 2 ...
Ellipticat's user avatar