namuol / hashids.node.js Goto Github PK

======

A small Node.js class to generate YouTube-like hashes from one or many numbers. Use hashids when you do not want to expose your database ids to the user. Read full documentation at: http://www.hashids.org/node-js/

1. Node it up: http://nodejs.org/download/

2. Install using npm:

   npm install -g hashids

BE CAREFUL WHICH VERSION OF HASHIDS YOU ARE USING.

Since future improvements to Hashids might alter produced hashes, it's a good idea to specify exact Hashids version in your package.json, if their consistency is important to you (if you are storing them in database):

	
	"dependencies": {
		"hashids": "0.3.2"
	}

You can pass a unique salt value so your hashes differ from everyone else's. I use "this is my salt" as an example.

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash = hashids.encrypt(12345);

hash is now going to be:

NkK9

Notice during decryption, same salt value is used:

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var numbers = hashids.decrypt("NkK9");

numbers is now going to be:

[ 12345 ]

Decryption will not work if salt is changed:

var Hashids = require("hashids"),
	hashids = new Hashids("this is my pepper");

var numbers = hashids.decrypt("NkK9");

numbers is now going to be:

[]

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash = hashids.encrypt(683, 94108, 123, 5);

hash is now going to be:

aBMswoO2UB3Sj

You can also pass an array:

var arr = [683, 94108, 123, 5];
var hash = hashids.encrypt(arr);

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var numbers = hashids.decrypt("aBMswoO2UB3Sj");

numbers is now going to be:

[ 683, 94108, 123, 5 ]

Here we encrypt integer 1, and set the minimum hash length to 8 (by default it's 0 -- meaning hashes will be the shortest possible length).

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt", 8);

var hash = hashids.encrypt(1);

hash is now going to be:

gB0NV05e

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt", 8);

var numbers = hashids.decrypt("gB0NV05e");

numbers is now going to be:

[ 1 ]

Here we set the alphabet to consist of valid hex characters: "0123456789abcdef"

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt", 0, "0123456789abcdef");

var hash = hashids.encrypt(1234567);

hash is now going to be:

b332db5

MongoDB uses hex strings for their ObjectIds. You can convert them to Hashids like this:

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash = hashids.encryptHex("507f191e810c19729de860ea");
var objectId = hashids.decryptHex(hash);

hash will be:

yNyaoWeKWVINWqvaM9bw

objectId will be as expected:

507f191e810c19729de860ea

The length of the hex string does not matter -- it does not have to be a MongoDB ObjectId.

The primary purpose of hashids is to obfuscate ids. It's not meant or tested to be used for security purposes or compression. Having said that, this algorithm does try to make these hashes unguessable and unpredictable:

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash = hashids.encrypt(5, 5, 5, 5);

You don't see any repeating patterns that might show there's 4 identical numbers in the hash:

1Wc8cwcE

Same with incremented numbers:

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash = hashids.encrypt(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);

hash will be :

kRHnurhptKcjIDTWC3sx

var Hashids = require("hashids"),
	hashids = new Hashids("this is my salt");

var hash1 = hashids.encrypt(1), /* NV */
	hash2 = hashids.encrypt(2), /* 6m */
	hash3 = hashids.encrypt(3), /* yD */
	hash4 = hashids.encrypt(4), /* 2l */
	hash5 = hashids.encrypt(5); /* rD */

This code was written with the intent of placing created hashes in visible places - like the URL. Which makes it unfortunate if generated hashes accidentally formed a bad word.

Therefore, the algorithm tries to avoid generating most common English curse words. This is done by never placing the following letters next to each other:

c, C, s, S, f, F, h, H, u, U, i, I, t, T

Hashids uses jasmine spec tests, particularly jasmine-node. To install sudo npm install -g jasmine-node then just run jasmine-node . in the root folder.

0.3.2 - Current Stable

• minor: contact email changed
• minor: internal version is accurate now

0.3.1

• minor: closure + readme update merged (thanks to @krunkosaurus)
• minor: a few cleanups

0.3.0

PRODUCED HASHES IN THIS VERSION ARE DIFFERENT THAN IN 0.1.4, DO NOT UPDATE IF YOU NEED THEM TO KEEP WORKING:

• Same algorithm as PHP version now
• Overall approximately 4x faster
• Consistent shuffle function uses slightly modified version of Fisher–Yates algorithm
• Generate large hash strings faster (where minHashLength is more than 1000 chars)
• When using minHashLength, hash character disorder has been improved
• Basic English curse words will now be avoided even with custom alphabet
• New unit tests with Jasmine
• Support for MongoDB ObjectId
• encrypt function now also accepts array of integers as input
• Passing JSLint now

0.1.4

• Global var leak for hashSplit (thanks to @BryanDonovan)
• Class capitalization (thanks to @BryanDonovan)

0.1.3

Warning: If you are using 0.1.2 or below, updating to this version will change your hashes.

• Updated default alphabet (thanks to @speps)
• Constructor removes duplicate characters for default alphabet as well (thanks to @speps)

0.1.2

Warning: If you are using 0.1.1 or below, updating to this version will change your hashes.

• Minimum hash length can now be specified
• Added more randomness to hashes
• Added unit tests
• Added example files
• Changed warnings that can be thrown
• Renamed encode/decode to encrypt/decrypt
• Consistent shuffle does not depend on md5 anymore
• Speed improvements

0.1.1

• Speed improvements
• Bug fixes

0.1.0

• First commit

Follow me @IvanAkimov

Or http://ivanakimov.com

MIT License. See the LICENSE file. You can use Hashids in open source projects and commercial products. Don't break the Internet. Kthxbye.