Questions tagged [performance]
Performance defines the abilities of a cipher in terms of processing throughput on various platforms, including its memory requirements.
123
questions
0
votes
0
answers
102
views
What is the fastest 128-bit non-cryptographic hash function?
I need a 128-bit hash function which is extremely fast since it will be used for generating unique IDs for billions of objects. It doesn't need to be a cryptographic hash function nor does it have to ...
- 103
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, ...
CommunityBot
- 1
1
vote
0
answers
42
views
Short-input (<= 128 bit), short-output (<= 10 bit) MAC
I am faced with a problem of selecting an appropriate message authentication code (MAC) for a particular application. These are the constraints:
I have two 64-bit integers $r_a$ and $r_s$ as input, ...
- 21
0
votes
0
answers
135
views
Do "superfast" keyed hash functions exist?
A common family of requirements for (cryptographic) keyed hash functions is that the function $h(k,-)$ should have good collision resistance for all keys $k$, even if the key $k$ is known to the ...
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 ...
- 48.5k
0
votes
1
answer
117
views
The relationship between polynomial degree and HE performance [closed]
any paper mentioning the performance decreases with N?
why when N is increasing, the performance decreases? any papers?
BR
- 13k
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 ...
- 92.6k
1
vote
0
answers
167
views
Why do the hash functions tested by SMhasher appear to be exceptionally fast?
In SMhasher, it seems that data (keys) are read one by one sequentialy, and not splited and:
...
- 393
1
vote
0
answers
91
views
SUPERCOP benchmark of signature scheme: Number of cycles of key generation
I'm having troubles in interpreting the output of the SUPERCOP benchmarks of some digital signature schemes.
Precisely, I don't understand how to read the number of cycles for the key generation. This ...
- 11
1
vote
1
answer
136
views
What exactly is a "pass" when talking about hashing, ciphers and MAC algorithms?
I was very surprised when I said that hashing the same data twice was "double pass" and a comment came in that this wasn't the case if the hashing could be performed in parallel. This would ...
- 147k
2
votes
1
answer
159
views
What would be the expected performance of hashing a seed with counters and using its keystream compared to SHAKE-256?
Hashing a seed with SHAKE-256 and setting the output size to 1GiB it takes 6.5 seconds on my system:
...
- 147k
1
vote
1
answer
1k
views
XChaCha20-Poly1305 vs Plain ChaCha20-Poly1305 performance
I know that the security of both are the same (only nonce size is different). But which one is faster and better to use, when encrypting a lot of files (500+, from 1MB to 200MB)?
- 1,802
1
vote
0
answers
81
views
Power consumption of Post-Quantum Crypto vs. legacy crypto
Is there any educated views or references on how the PQC NIST finalists compare to legacy crypto with regards to power consumption?
Many thanks
- 2,595
-1
votes
1
answer
65
views
How to read clock cycle from latency tables?
I see many papers that compare the latency of the signature schemes in terms of clock cycles by two-three numbers. I don't know why they write 2-3 numbers instead of one number to represent clock ...
- 1,365
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 ...
- 1,649
1
vote
0
answers
68
views
Are there any "hard lower bounds" to zero-knowledge proving space/time/commmunication complexity?
There is a lot of "retail investor" hype implying a zk revolution in the future where we have circuits for common instruction sets and many software backends are zk-proven.
I'm wondering, ...
- 121
5
votes
1
answer
298
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}$ ...
- 92.6k
1
vote
0
answers
52
views
Implementation size of post quantum schemes
I was comparing classical schemes with post-quantum schemes. Therefore I was interested in the round three candidates of the NIST standardization process. So far I know, that those post-quantum ...
- 2,264
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 ...
- 141k
0
votes
0
answers
214
views
Comparing the performance of ECC/RSA with post quantum protocols
I wanted to compare the performance of different cryptographic systems. There is a pretty good paper comparing the 3rd round finalists of the NIST competition.
I was wondering if there are good ...
- 2,264
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 ...
- 15.3k
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 ...
- 1
1
vote
1
answer
370
views
What would be the benefit of using a Stream Cipher which achieves encryption performance of 0.01 cpb using 1 CPU thread?
If such throughput could be achieved what would the benefits for a data center or IoT devices in terms of power saving. Also I was wondering if such speed was possible to be realized by a cipher, ...
- 3,361
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 ...
- 141k
1
vote
2
answers
109
views
Small public key size or small signature size, which is preferred?
Suppose two signature schemes provides the same level of security. The sum of the sizes of a public key and a signature, i.e., sizeof(sig) + sizeof(pk), are equal in the two schemes. One of the ...
- 13k
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 ...
- 141k
1
vote
2
answers
294
views
fast encryption with one key and fast decryption with multiple keys sequentially
Is there such a encryption and decryption mechanism: Given an encryption C = E(K1, M), where K1 is the encryption key and M is plain text, it have to apply decryption with two keys K2 and K3 ...
1
vote
1
answer
278
views
Does key sizes specified in ASD Approved Cryptographic Algorithms impact operational performance?
Does the key sizes specified in Australia's ASD Approved Cryptographic Algorithms impact operational performance?
The larger the key size the slower the operational performance. Is it true?
The set of ...
- 92.6k
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:...
- 951
2
votes
1
answer
151
views
How does table size impact table lookup speed?
Are there good discussions of how cache pressure impacts large 64k-ish lookup tables used in erasure coding and sometimes signature verification?
I'll focus on erasure coding in small characteristic ...
- 147k
0
votes
1
answer
105
views
Encryption algorithms that require more work to decrypt versus encrypt?
Are there any encryption algorithms that require significantly more work to decrypt, versus the amount of work required to encrypt?
I'm looking for a method of fast encryption, but which will require ...
- 1
0
votes
0
answers
70
views
Periodic re-keying during full drive encryption
A man encrypted a hard drive in 1996 using three key 3-DES with a 64 bit IV and CBC mode in the following manner using known 1990s algorithms on a 1996 PC. Here is how he did it.
Start with a ...
0
votes
0
answers
511
views
Is there a more efficient C# CryptoStream implementation for streaming decryption of large files
I am using LibVLC and Unity to playback locally stored encrypted 360 videos. VLC's Unity package has a feature to play content via a C# stream. I am using a FileStream wrapped in a CryptoStream to get ...
- 6,445
1
vote
0
answers
144
views
Sorted merkle tree versus rsa accumulator
When compared to sorted merkle tree and rsa accumulator, which one is the best? Rsa accumulator has constant proof and it adds/deletes at constant cost. What is the verification cost for rsa ...
- 187
0
votes
1
answer
432
views
How to measure brute force speed of a computer for a give cipher with given number of keys for second for a given key space
As I understood brute force attack is measured in number of keys which in turns give time required based on speed of computer
It is quite interesting find out how effective an arbitrary computer is ...
- 2,611
1
vote
1
answer
1k
views
Testing speed of symmetric vs asymmetric encryption and decryption using gpg
I'm aware that symmetric is faster than asymmetric.
I want to test this, but my (obviously incorrect) tests show the reverse.
Symmetric test:
...
- 92.6k
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 ...
- 1,962
2
votes
1
answer
1k
views
Msieve & Yafu - RSA Exponents and bruteforcing
I am a layman in regards to the math behind RSA (and in general, relatively), and my goal is to bruteforce a large quantity of 512-bit RSA keys. Having searched around, I see that msieve, yafu, and an ...
- 141k
2
votes
0
answers
113
views
What's the meaning of "Ops" in this ABE schemes performance form?
I am a Ph.D. student focusing on Attribute-Based Encryption, and now I'm reading the paper "Outsourcing the Decryption of ABE Ciphertexts", seen in Figure 1 below. It gives a summary of an ABE scheme ...
- 3,132
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 ...
CommunityBot
- 1
1
vote
1
answer
304
views
Why Stream Ciphers can be slower in software than Block Ciphers
I made some tests on virtual environment (Virtual Box) using StrongSwan, a VPN based on IPSec. I had latency results using ping command saying that Chacha20 (stream cipher) had poor performance ...
- 632
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 ...
- 41
0
votes
2
answers
175
views
Is it Ok in practice to rely only on the first 64 bits of a scrypt hash in this scenario?
I’m in a situation where I need to perform authentication against a large set of exactly 8 bytes longs passwords (with however full choice of encoding from the user and even custom encoding support): ...
CommunityBot
- 1
1
vote
0
answers
101
views
Caculated time One Point Multiplication with double and method
I am using double and add method for point multiplication in affine coordinates. How we compute 1PM in double and method?
Di Wang said one point multiplication consists of repeated addition and ...
- 48.4k
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?
CommunityBot
- 1
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 ...
- 48.4k
0
votes
2
answers
5k
views
How much time does AES decryption take?
I am attempting to decrypt a 90 GB file that is encrypted using AES-256. I have the password. How long should this take to complete? I've had the process running for over 3 days with no progress.
0
votes
2
answers
562
views
SHA1 calculation for millions of strings having common prefix
I have a function in which I need to calculate SHA1(common_prefix + random_string). I am calling this function many times so that calculation of SHA1 slows down the performance of the function. As for ...
- 48.4k
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.
CommunityBot
- 1
0
votes
1
answer
116
views
What are sources for the performance difference in asymmetric and symmetric encryption?
I see the claim (which I'm not doubting) that encrypting data using asymmetric algorithms is slower than symmetric algorithms.
But I never see citation on these claims, not here, on wikipedia or even ...
- 19.6k