Tag Info

New answers tagged

2

The difference between generating a KeyPair with CKA_TOKEN set as true and false is that when it is set to true, the KeyPair that is generated by the hardware token is persisted (it exists on the token even after you logout of the session). If it is set to false, it is still generated on the hardware and not outside the token, it is just not persisted (it ...


0

Short answer: yes you are right and you can do this. To be on the safe side however, you must ensure not to lower the HMAC function security by using it properly and not putting wrong expectation on the function used. By design HMAC functions expects one parameter to be a secret key, and the other being a message which could be public (you can find more ...


2

http://anandam.name/pbkdf2/ - I think this does it. It says demo but I think it does the job. https://www.dailycred.com/article/bcrypt-calculator - So does this.


1

You can use javascript-bcrypt or crypto-js for PBKDF2. I don't know any scrypt JS implementations so I don't want to recommend one (you can always Google). While you mention scrypt in your question, I think that bcrypt and PBKDF2 are the most widely used functions.


3

PBKDF2 is supposed to be secure as a key derivation function, which more or less means that knowing some of the output bytes leaves no usable information for guessing the other output bytes. If you produce 20 bytes with PBKDF2 but the attacker knows 12 of them, he still cannot guess the 8 remaining with better probability than pure luck (i.e. 2-64, since 8 ...


0

Of course it makes it easier. Your chance of randomly guessing a key of length 2n bytes is 1 / 2 ^ 16n. If you know the first or last n bytes, then your chance of guessing the rest is 1 / 2 ^ 8n, which is 2 ^ 8n times more likely.


3

Right now (July 2015), the current record for RSA key breaking is for a 768-bit modulus, and it took two years of computations with a lot of machines, and, importantly, with some very fine brains too. A notable point is that the best known RSA-breaking method (that was used for RSA-768) is integer factorization with the General Number Field Sieve; GNFS does ...


1

For Shamir's secret sharing, the only possible method for validating a share is rebuilding the shared secret with enough shares, and see if the result makes sense. There cannot be any other method that does not involve sufficiently many shares to reach the threshold, because that would contradict information theoretic security of the scheme (basically, if ...


2

The OpenSSH format is unsurprisingly supported by OpenSSH tools. (The OpenSSH public-key format, used in authorized_keys and with a prefix added in known_hosts, isn't itself a "de jure" standard, but is a trivial modification of a public-key encoding within the SSH2 protocol which is standardized.) Less obviously, OpenSSH uses OpenSSL format(s) for private ...



Top 50 recent answers are included