Questions tagged [hashing]
A hash function is any algorithm that maps data of arbitrary length to data of a fixed length. The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes. From Wikipedia: http://en.wikipedia.org/wiki/Hash_function
163
questions
5
votes
5
answers
3k
views
How can I protect an SQL connection string in a client-side application?
I am developing a .NET Windows application and I need to make requests to a SQL Server instance. How do I secure the authentication data in my code in case someone decompiles my application?
I know ...
- 21k
5
votes
1
answer
2k
views
Using PostgreSQL MD5 hash to calculate a 64 bit hash value for advisory lock functions?
I have a particular problem addressing the PostgreSQL advisory locking functions using the bigint variants.
Basically I want to create a 64 bit bigint value from a text type obtained with the ...
CommunityBot
- 1
8
votes
4
answers
3k
views
How to perform consistent hashing on any Python object that works with hash()?
I have a Python library that performs a kind of calculation given a parameter-object. A requirement of the parameter object is that it be both hashable and serializable. It's a long calculation, so it ...
- 101
1
vote
0
answers
832
views
Does multiple Bloom filters make sense?
In order to decrease the number of false positives, I came up with a couple of possible solutions.
Create two different types of Bloom filters; eg. filter1 using 3 different hash algorithms, filter2 ...
CommunityBot
- 1
0
votes
0
answers
70
views
Where and if to declare Hash algorithm used
Not quite sure if this belongs here or on the crypto board...
Hi :)
We are using hash functions, not for hashing passwords but for digital signatures.
Architecture is having one gateway who has to ...
- 3,456
6
votes
3
answers
435
views
What is the benefit of caching a hash value in a string object?
I made a patch to a programming language run-time to cache the results of hashing a string in the string object, so that it is just retrieved the next time it is required.
However, I'm not convinced ...
- 17.6k
1
vote
1
answer
409
views
What are Hash Functions? [closed]
I am trying to read up on System Design, and several articles talk about how a Primary Key for the input data, which is a string, can be passed into a Hash function and we get a number. This can ...
- 130k
0
votes
1
answer
572
views
Why is there no Hashmap in C++ like Java? [closed]
I know that the C++ standard library includes the ordered and the unordered map (std::map and std::unordered_map) containers, but why is there no hashmap available on C++? I was asked this questions ...
- 72k
-1
votes
2
answers
2k
views
How does Pearson hashing compare with other non-cryptographic hashing algorithms?
FNV-1, Murmur2, and DJB2 are examples of non-cryptographic hashing functions used in actual applications (see Which hashing algorithm is best for uniqueness and speed?). These are all similar in that ...
- 101
2
votes
2
answers
277
views
Modulo Division of Hash Output
In a design book I was reading they describe a method to determine a database sharding scheme by taking the hash (MD5, SHA1, whatever) of a userid (integers or uuids) and then (whether encoded or not) ...
- 101k
-5
votes
6
answers
272
views
(closed) Why do we bother hashing data?
I don't understand why we hash data like passwords. I know it's harder to steal hashed data rather than just plain text, and it takes longer, but once one of those public hashing methods gets cracked, ...
1626
votes
11
answers
806k
views
Which hashing algorithm is best for uniqueness and speed?
Which hashing algorithm is best for uniqueness and speed? Example (good) uses include hash dictionaries.
I know there are things like SHA-256 and such, but these algorithms are designed to be secure,...
- 3,127
0
votes
0
answers
284
views
Designing a unique id reliably based on a String date?
I am creating an Android application that sets alarms based on the String date of a list of Objects (PendingIntents, with each taking in an id, that is an integer). In order to cancel the ...
- 129
2
votes
2
answers
173
views
Is there a reliable way to get get the fingerprint of a file hosted online, without fully downloading it?
Background
Tertiary to this question, I have been building my own imageboard that prevents [for example] duplicate images from being downloaded again and again on behalf of the client. How I do this, ...
- 10.2k
3
votes
1
answer
996
views
Is consistent hashing required for sharding?
I am reading about scaling of database and came to know about sharding technique. But I also read about consistent hashing technique. So how practically sharding is implemented? Do we arrange nodes in ...
- 11.3k
1
vote
1
answer
2k
views
Is it ok to use redis scan extensively?
In redis docs, it is stated that keys command should not be used in production, since it blocks other processes while executing, it is better to use scan iteration over all keys with some batch size.
...
- 3,092
5
votes
1
answer
1k
views
Why use strong checksums to detect random errors in a filesystem like btrfs?
Btrfs supports crc32c, xxhash, sha256 and blake2b as checksums when storing and reading files. crc32c and xxhash are designed to detect random errors while sha256 and blake2 are considered ...
- 712
-4
votes
4
answers
2k
views
Time efficient way to count pairs in an array whose sum is divisible by a specific number?
Given an array of integers, we want to find how many explicit pairs can be made such that their sum is divisible by 60. The pairs are not necessarily non-unique.
For example, let's say the input into ...
- 192
-1
votes
1
answer
278
views
Is this no-collision-type hash algorithm safe?
I've designed a hash algorithm based on mathematical exponentiation, exponentiating each number by its following number. To be able to exponentiate indefinitely, numbers are first normalized to a 0-1 ...
- 125
-3
votes
2
answers
924
views
Which hash algorithm is best for speed and identical hashes. (a lot of collisions)
I'm searching an existing hash function or trying to make a hash function that has a lot of collisions.
Regularly a hash is used for it's ability to create unique hashes for hash tables or security ...
- 101k
3
votes
3
answers
3k
views
Garbage collection & memory leaks on hash tables
I was reading R. Read's How to be a programmer, and I came accross something I didn't understand:
...even with garbage collection, you can fill up all memory with
garbage. A classic mistake is to ...
- 101
0
votes
1
answer
43
views
Combine Multiple Minimal Perfect Hashing
I'm building some Minimal Perfect Hash from multiple datasets using the CHD algorithm
I would like to know if there exists a "smart" way to combine all the different MPH obtained from ...
- 456
1
vote
1
answer
326
views
Does the SHA256 hashing algorithm change based on the content encoding?
I am starting to look into how to implement SHA256 in JavaScript, and found this for example. It requires UTF-8 encoding it sounds like. Another one I saw required/supported only ASCII encoding and ...
- 40.5k
1
vote
3
answers
504
views
hash-like algorithm to identify passwords which are "too similar" to previous ones from history
One common issue with secure passwords is that users tend to "cheat", one common cheating pattern we meet recently is the "password swap" antipattern where the user basically keeps using the same two ...
- 24.5k
-2
votes
1
answer
72
views
Find circular references of first order (bi-directional referencing)
I have million of objects, each with an array smaller than 10 elements, which are the names of other objects in the dataset.
Basically
{
a:[b,c,d,],
b:[c,d,e],
c:[a,e,f],
...
e:[a,b,c]
}
will ...
- 3,456
0
votes
1
answer
173
views
How to implement FNV-1(a) in SQLite?
Moved
I originally posted this on SoftwareEngineering because that's where this related question was; but having looked into the Help in detail, I think my question is more on-topic for stackoverflow,...
- 154
142
votes
3
answers
25k
views
Where do "magic" hashing constants like 0x9e3779b9 and 0x9e3779b1 come from?
In code dealing with hash tables, I often find the constant 0x9e3779b9 or sometimes 0x9e3779b1. For example
hash = n * 0x9e3779b1 >>> 24
Why is this particular value used?
- 142
1
vote
1
answer
442
views
Hashing from within the database or outside?
I am in the process of evolving architecture for an 'equity analysis system'. I will be using SQLServer as the database, but I am not going the .NET route and won't be using the built-in 'membership' ...
- 9,347
0
votes
1
answer
223
views
Hashset vs Treeset
I've always loved trees, that nice O(n*log(n)) and the tidiness of them. However, every software engineer I've ever known has asked me pointedly why I would use a TreeSet. From a CS background, I don'...
- 10.2k
0
votes
0
answers
105
views
Searching/Hashing Wikipedia - at each position for keys 1..31 long, the fastest way?
A C coder here.
My wish is to find the best way to search words and phrases within the ever-growing English Wikipedia XML dump. As a first layer/step, hashing is the answer, yes?
The problem is that ...
- 17
2
votes
1
answer
692
views
Client Side Hashing + Server Side Hashing
Suppose one wishes to implement an account system for their service/website.
There have been cases with Instagram for example where passwords were accidentally stored in plain text due to ...
- 8,821
-2
votes
2
answers
1k
views
What are some disadvantages for a hashmap with timestamp as key? [closed]
"What are some problems that can arise from using a HashMap with timestamp as keys"?
I, for one, do not see any major issues with this kind of "setup".
Is this "setup" a no-go/an anti-pattern/...
- 97.8k
0
votes
1
answer
46
views
portable hashable string representation of data object
I have a class of (flat) objects that are going to be passed around between three different parties, each possibly running a different software stack.
my_object:
item: "string_a"
money:
...
- 404
16
votes
6
answers
6k
views
How to implement float hashing with approximate equality
Let's say we have the following Python class (the problem exists in Java just the same with equals and hashCode)
class Temperature:
def __init__(self, degrees):
self.degrees = degrees
...
- 3,127
0
votes
1
answer
946
views
Distribute jobs evenly among a set of servers
I have the need to distribute a set of long running jobs across a cluster of containers in ECS. These jobs essentially would need to open a socket connection with a remote server and begin streaming ...
- 15.7k
2
votes
1
answer
835
views
Explanation of how to resolve Hash conflicts in HAMT or hashtables in general
I am working on trying to understand HAMT and now am uncertain generally what to do when you run into a conflict in a hash. All I understand so far is you create a list to append the keys to, but I ...
- 5,851
11
votes
3
answers
10k
views
How does a web browser save passwords?
How do current web browsers (or mobile mail clients and any software in general) save user passwords? All answers about storing passwords say we should store only hashes, not the password themselves. ...
- 25.6k
0
votes
3
answers
196
views
Is there a secure way to check previous passwords purely on the client-side?
We have a requirement for a security audit that our password policy must disallow the re-use of a previous password from the last 4 used passwords.
We can accomplish this fairly easily by making a ...
- 11.8k
10
votes
5
answers
1k
views
If passwords are stored hashed, how would a computer know that your password is similar to the last one if you try resetting your password?
If passwords are stored hashed, how would a computer know that your password is similar to the last one if you try resetting your password? Wouldn't the two passwords be totally different since one is ...
- 41
9
votes
3
answers
28k
views
What are the advantages of linear probing over separate chaining or vice-versa when implementing hash tables?
I've been brushing up on algorithms and reviewed these two methods of implementing hash tables. It seems like they largely have similar performance characteristics and memory requirements.
I can ...
CommunityBot
- 1
3
votes
0
answers
416
views
LSH for a wordlist
I am trying to write a spellchecker, I have a huge wordlist (at least 500K, because of the nature of the language). The performance would suffer a lot if I got the lavenshtein distance of all of the ...
- 139
2
votes
1
answer
2k
views
Where and how to handle user password hashing in Clean Architecture?
I'm currently building a new application and trying to apply some of the principles of Clean Architecture. One of my first roadblocks is implementing my own Identity system (to avoid being tightly ...
- 130k
0
votes
1
answer
413
views
A collision-free hash-like function for use in hash tables and other data structures?
A short introduction to the problem: I'm working with a small database where I have a table of strings (web URLs, to be precise) as pairs: hash|string. Another table references these strings by hash ...
- 284
75
votes
2
answers
57k
views
Why do so many hashed and encrypted strings end in an equals sign?
I work in C# and MSSQL and as you'd expect I store my passwords salted and hashed.
When I look at the hash stored in an nvarchar column (for example the out the box aspnet membership provider). I've ...
CommunityBot
- 1
2
votes
1
answer
266
views
Hashing tag list to perform faster search
I have a list of items. Each item have various properties. Each item can be tagged, like tagging a post here. Right now, tags are represented using a Tags property, that is a string and it looks like ...
CommunityBot
- 1
50
votes
8
answers
61k
views
Why almost no webpages hash passwords in the client before submitting (and hashing them again on the server), as to "protect" against password reuse?
There are many sites on the Internet that require login information, and the only way to protect against password reusing is the "promise" that the passwords are hashed on the server, which is not ...
- 198k
3
votes
0
answers
221
views
Hashing algorithm without the avalanche effect
I know that one of the most important features of hashing algorithms, is that minor changes in the input should reflect great change in the hash itself (the avalanche effect), but I'm currently ...
- 194k
0
votes
1
answer
489
views
Logic Behind a Basic Hash Table Hashing Algorithm
I am trying to write a Hash Table in Java based on some Princeton article about it.
The most commonly used method for hashing integers is called modular
hashing: we choose the array size M to be ...
- 3,904
2
votes
3
answers
2k
views
Randomized Hash function with no collisions
Related to the question Which hashing algorithm is best for uniqueness and speed?
Is there a way to create a hash function, or find one, whose hash length depends completely on the input length, has ...
- 101
7
votes
3
answers
8k
views
What is an example for a one-way hash function?
I am doing a bit of research on hash functions. I understand the concept that it is an equation that is easy to do one way (you take the number 00011010 for example and do reasonably simple math with ...
- 22.6k