Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with related-keys
Search options answers only
not deleted
user 86107
Keys with an exploitable mathematical relationship, and the attacks they enable
0
votes
Accepted
Using TEA to build a hash function
As you note in the comments, this would not be secure, because the block size is insufficient. A 64-bit hash is subject to extremely trivial collision attacks and feasible preimage attacks.
But TEA a …
- 3,544
1
vote
RC4 Klein (or other) attack susceptibility question
There are a bunch of problems with this.
One obvious one is that your "signature" is three bytes long, which is 24 bits and subject to brute forcing.
Another is that for most cases, a three-byte nonc …
- 3,544