Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

New answers tagged

0 votes

Looking for a lightweight hashing algorithm

A simple ARX construct can do with less than the required 400 bytes of executable code, if we require neither: speed, low RAM usage, having withstood the test of years of cryptanalysis attempts after ...
fgrieu's user avatar
  • 142k
2 votes

Looking for a lightweight hashing algorithm

Ascon, (Reference Implementation) Also, a bare-minimum of 700-octet Kolmogorov complexity seems to be necessary for the application(s) of secure hashing.
DannyNiu's user avatar
  • 9,409
0 votes

Adding 2 hash values

A trivial example is the hash function SHA-256 but keep only the two first bits. We now want to satisfy the equality: hash(a) + hash(b) = hash(c) We know that ...
n-l-i's user avatar
  • 515
0 votes

Adding 2 hash values

Yes, as we assume for most hash values that the output is well distributed within the group. Normally we do assume modular addition over $2^h$ though where $h$ is the output size of the hash function. ...
Maarten Bodewes's user avatar
2 votes
Accepted

Necessity of all three MD-Compliant padding conditions

This is necessary since we want the padding at the end for performance reasons. We don't place it in the beginning or the middle since we may not have the means to process all the data. The end is the ...
kelalaka's user avatar
  • 48.7k
1 vote
Accepted

How to design a reversible shifted XOR with an S-box?

The kind of S-box you're trying to use is a permutation, and your goal is to build a permutation out of it. The easiest way to show that something is a permutation, and the approach we typically use ...
bk2204's user avatar
  • 3,466

Top 50 recent answers are included