MetroHash | Simple C # port of MetroHash | Hashing library

by Tornhoof C# Version: Current License: MIT

X-Ray Key Features Code Snippets Community Discussions(3)Vulnerabilities Install Support

kandi X-RAY | MetroHash Summary

MetroHash is a C# library typically used in Security, Hashing, Example Codes applications. MetroHash has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

This is a direct port of J. Andrew Rogers' Metro Hash 128 algorithm. Compare

Support

Quality

Security

License

Reuse

Support

MetroHash has a low active ecosystem.

It has 6 star(s) with 1 fork(s). There are 3 watchers for this library.

It had no major release in the last 6 months.

MetroHash has no issues reported. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of MetroHash is current.

Quality

MetroHash has no bugs reported.

Security

MetroHash has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

MetroHash is licensed under the MIT License. This license is Permissive.

Permissive licenses have the least restrictions, and you can use them in most projects.

Reuse

MetroHash releases are not available. You will need to build from source code and install.

Installation instructions are not available. Examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of MetroHash

Get all kandi verified functions for this library.

MetroHash Key Features

No Key Features are available at this moment for MetroHash.

MetroHash Examples and Code Snippets

No Code Snippets are available at this moment for MetroHash.

Community Discussions

Trending Discussions on MetroHash

Error installing native Node.js add-on with node-gyp on Apple M1 (Big Sur)

Unsafe.As from byte array to ulong array

Is triple-CRC-32 a bad (or not) idea for generating a non-secure uniform distribution hash?

QUESTION

Error installing native Node.js add-on with node-gyp on Apple M1 (Big Sur)

Asked 2021-Mar-02 at 17:24

I'm using yarn to install packages including asset-hash, which depends on metrohash.

I constantly run in the following error:

...

ANSWER

Answered 2021-Mar-02 at 17:24

With the help of a colleague I could fix the error.

I had to uninstall brew and reinstall it using Rosetta. Then I reinstalled node and yarn also using the Terminal in Rosetta mode.

Source https://stackoverflow.com/questions/66427623

QUESTION

Unsafe.As from byte array to ulong array

Asked 2018-Nov-11 at 22:09

I'm currently looking at porting my metro hash implementon to use C#7 features, as several parts might profit from ref locals to improve performance. The hash does the calculations on a ulong[4] array, but the result is a 16 byte array. Currently I'm copying the ulong array to the result byte buffer, but this takes a bit of time. So i'm wondering if System.Runtime.CompilerServices.Unsafe is safe to use here:

...

ANSWER

Answered 2017-Jun-16 at 21:45

C# supports "fixed buffers", here's the kind of thing we can do:

Source https://stackoverflow.com/questions/42695067

QUESTION

Is triple-CRC-32 a bad (or not) idea for generating a non-secure uniform distribution hash?

Asked 2017-Dec-03 at 17:49

I have an input of 288 bits (comprising 4 × 32-bit identity function outputs and 10 × 16-bit integers). I need to hash this to 96 bits with as few collisions as possible. The goal could be stated as key compression with probabilistic collisions.

I'm aware that CRC is a bijective hash, thus ensuring 100% even distribution (as I understand it). In my view, I should be able to run 3 parallel CRC paths through the input, resulting in a 96-bit lossy hash (obviously not bijective) of optimum distribution.

However, I'm also aware that CRC is not used for such applications. An algorithm such as MetroHash would typically be used.

Could someone explain to me why CRC is a bad (or not) idea for this application?

Note: This is not intended for anything secure.

...

ANSWER

Answered 2017-Dec-03 at 17:49

Sure, that can work, but there are probably better approaches.

For it to work, you would need to use three different CRC-32's with three different polynomials. And even then, be careful that they don't have common factors (e.g. x+1), to make sure that there are no correlated bits between the three.

Better would be an approach like used in xxhash, but extended to 96 bits. That would be faster in software.

Why 96 bits? That seems like an unnecessarily long hash.

Source https://stackoverflow.com/questions/47617560

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install MetroHash

You can download it from GitHub.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: