sha1

I am using this line to generate a sha1 id for node.js: crypto.createHash('sha1').digest('hex'); The problem is that it's returning the same id every time. Is it possible to have it generate a random id each time so I can use it as a database document id? Gabi Purcaru Have a look here: How do I use node.js Crypto to create a HMAC-SHA1 hash? I'd create a hash of the current timestamp + a random number to ensure hash uniqueness: var current_date = (new Date()).valueOf().toString(); var random = Math.random().toString(); crypto.createHash('sha1').update(current_date + random).digest('hex');

I am implementing a simple DHT using the Chord protocol in Java. The details are not important but the thing I'm stuck on is I need to hash strings and then see if one hashed string is "less than" another. I have some code to compute hashes using SHA1 which returns a 40 digit long hex string (of type String in Java) such as: 69342c5c39e5ae5f0077aecc32c0f81811fb8193 However I need to be able to compare two of these so to tell, for example that: 0000000000000000000000000000000000000000 is less than: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF This is the complete range of values as the 40 digit

Working with several DBs in parallel and need to initialize some records with hashed passwords. In MS SQL server there are handy functions that allow to hash on the fly: HashBytes('SHA1', CONVERT(nvarchar(32), N'admin')) Is there is a similar function with SQLite ? If not, which is the easiest workaround (such as select from SQL server and somehow insert it into SQLite tables)? The preferred hashing algorithm is SHA1 and the passwords are stored in a BLOB column. Update: I use C# language in the current project. kennytm There is no such function built into SQLite3. But you could define a user

I'm trying to match SHA1's in generic text with a regular expression. Ideally I want to avoid matching words. It's safe to say that full SHA1's have a distinctive pattern (they're long and a consistent length) - so I can match these reliably - but what about abbreviated SHA1's? Can I rely on the presence of numbers? Looking at the SHA1's in my commit log - numbers always appear in the first 3 characters. But is this too short? How many characters of SHA1 do I need to consider before I can assume a number would have appeared? This does not have to be 100% accurate - I just need to match an

I would like to know what is the length of RSA signature ? Is it always the same size as the RSA key size like if the key size is 1024 then RSA signature is 128 bytes , if the key size is 512 bits then RSA signature is 64 bytes ? what is RSA modulus ? Also what does RSA-sha1 mean ? Any pointers greatly appreciated. emboss You are right, the RSA signature size is dependent on the key size, the RSA signature size is equal to the length of the modulus in bytes. This means that for a "n bit key", the resulting signature will be exactly n bits long. Although the computed signature value is not

I'm looking at implementing an app getting Twitter authorization via Oauth in Java. The first step is getting a request token . Here is a Python example for app engine. To test my code, I am running Python and checking output with Java. Here is an example of Python generating a Hash-Based Message Authentication Code (HMAC): #!/usr/bin/python from hashlib import sha1 from hmac import new as hmac key = "qnscAdgRlkIhAUPY44oiexBKtQbGY0orf7OV1I50" message = "foo" print "%s" % hmac(key, message, sha1).digest().encode('base64')[:-1] Output: $ ./foo.py +3h2gpjf4xcynjCGU5lbdMBwGOc= How does one