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
0 votes
0 answers
73 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 ...
TypicalHog's user avatar
1 vote
0 answers
36 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, ...
asnfkjsdx's user avatar
0 votes
0 answers
131 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 ...
SocraticMathTutor's user avatar
0 votes
1 answer
99 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
macknight's user avatar
1 vote
0 answers
159 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: ...
alpominth's user avatar
  • 393
1 vote
0 answers
86 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 ...
rouguex's user avatar
  • 11
1 vote
1 answer
127 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 ...
Maarten Bodewes's user avatar
  • 92.4k
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
2 votes
1 answer
152 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: ...
phantomcraft's user avatar
1 vote
1 answer
947 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)?
kiiro's user avatar
  • 25
1 vote
0 answers
80 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
Jimakos's user avatar
  • 755
-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 ...
Behnam zahednejad's user avatar
1 vote
0 answers
65 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, ...
llllvvuu's user avatar
  • 121
1 vote
0 answers
51 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 ...
Titanlord's user avatar
  • 2,234
0 votes
0 answers
208 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 ...
Titanlord's user avatar
  • 2,234
1 vote
1 answer
362 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, ...
Tunnel_Vision's user avatar
1 vote
2 answers
104 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 ...
FoolishB's user avatar
1 vote
2 answers
290 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 ...
William's user avatar
  • 11
1 vote
1 answer
261 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 ...
TIMOTHY LIM'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
2 votes
1 answer
138 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 ...
Jeff Burdges's user avatar
  • 1,116
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 ...
poly's user avatar
  • 1
0 votes
0 answers
69 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 ...
GuyOnInternet's user avatar
0 votes
0 answers
492 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 ...
Robert Coomber's user avatar
1 vote
0 answers
141 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 ...
jhdm's user avatar
  • 187
0 votes
1 answer
307 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 ...
neotam's user avatar
  • 101
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: ...
lonix's user avatar
  • 147
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 ...
Acinomatnas's user avatar
1 vote
1 answer
301 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 ...
André Luiza's user avatar
0 votes
2 answers
172 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): ...
user2284570's user avatar
0 votes
2 answers
545 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 ...
user1945535's 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
0 votes
1 answer
113 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 ...
Minix's user avatar
  • 123
0 votes
1 answer
1k views

Does password length affect AES encrypt/decrypt velocity?

I'm implementing crypto in Node, following this article: https://lollyrock.com/articles/nodejs-encryption/ It defines: ...
Broda Noel's user avatar
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.
Jon's user avatar
  • 1
1 vote
1 answer
454 views

Why is Poly1305, which is based on AES, faster than AES?

The web pages of BearSSL have the following performance numbers: Poly1305 1730.92 MB/s, amd64, ctmulq AES-128 CTR 92.38 MB/s, amd64, ct64 It seems that constant-time Poly1305 is over an order of ...
juhist's user avatar
  • 1,247
1 vote
1 answer
1k views

How fast a middle-class computer can verify assymetric signatures (like ECDSA, RSA etc.)?

I have an idea for a peer-to-peer network that will require every connected peer to verify many symmetric signatures per second. In bitcoin, it's the same - every peer independently verifies ...
user84415's user avatar
2 votes
2 answers
2k views

Which is slower, AES or GCM hash (GHASH), if CPU has no special instructions?

In an answer to this question: Security of GCM if Implemented with Stream Cipher instead of Block Cipher ...it was stated that: The GHASH part of GCM is usually the problematic one when it comes to ...
juhist's user avatar
  • 1,247
-1 votes
1 answer
964 views

Do (equal) increases in performance provide advantages to any party?

Assume a cryptographic algorithm in which the performance for the good guys (the ones that know the key) grows linearly with the length of the key, and for which the only way to break it is a brute-...
Rashma's user avatar
  • 9
3 votes
0 answers
208 views

Optimizing the AES key schedule when round keys cannot be cached

I have an implementation of AES which can cache at most a 256-bit value between encryptions. Currently, the master key is cached and the key schedule is re-computed for each and every block. Is there ...
forest's user avatar
  • 15.2k
1 vote
0 answers
48 views

Crypto Vs crypto-less key establishment protocols for Internet of Things applications [closed]

With the advent of IoT, crypto-less key establishment protocols exploiting intrinsic channel randomness of physical layer are gaining great interest. These crypto-less protocols are computationally ...
amit 's user avatar
  • 77
1 vote
1 answer
1k views

Is authentication more computationally expensive than encryption?

newbie in crypto here. I've a application that needs integrity protection. Confidentiality would be nice but has less priority over performance throughput. So I test "openssl speed" on my laptop, and ...
ccaapton's user avatar
10 votes
1 answer
755 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.2k
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.2k
2 votes
3 answers
416 views

Can a key exchange protocol exchange a one time pad instead of a key?

As I understand key exchange, two parties can agree on a fixed number of secret bits in the presence of a listening adversary. That set of bits forms a cryptographic key which is then used to encrypt ...
Paul Uszak's user avatar
  • 15.3k
2 votes
1 answer
497 views

Size and usage of lookup table in cryptographic schemes

I would like to understand the typical size of a lookup table for software implementations of a cryptographic scheme. What size is considered reasonable? What make them (in)efficient? Are there ...
Dingo13's user avatar
  • 2,847
2 votes
1 answer
211 views

Size of bitwise OR between vectors represented as polynomials

I am using polynomials to represent bit vectors, such that the value of the d-th coefficient is $1$ if the d-th bit in the vector is $1$, and $0$ otherwise. For example, the vector $A = [1, 1, 0, 1, 0]...
mshcruz's user avatar
  • 167
1 vote
2 answers
3k views

is DES Faster Than AES on software

I conducted a software based experiment for encrypting difference size of images using AES and DES. However unexpectedly DES encryption speed was higher than AES. is it possible that DES is faster ...
smokkedwheel1's user avatar
-1 votes
1 answer
223 views

Encrypted TrueCrypt HDD and processor performance [closed]

Does the chosen algorithm affects the needed processor performance directly? Is a drive encrypted with Serpent as fast as one encrypted with AES-Twofish-Serpent? Does this apply to the hash ...
prototype0815's user avatar
1 vote
1 answer
2k views

Fast Symmetric Encryption Algorithms: My Options

Basically, the question above... I'm trying to implement encryption on the server, and I have another webserver that I can share a secret key with via TLS/SSL/HTTPS, so I do not really need ...
Whiteclaws's user avatar