I’ve got the same problem and it had a different cause. Now guess what 🙂 … The damn password was wrong 🙁 Searched 3 days for that “solution”. Could have been a “Sorry dude, that’s the wrong password!” instead of “nested asn1 error” imho but anyways, maybe this will help somebody.
You can use phpseclib, a pure PHP RSA implementation: <?php include(‘Crypt/RSA.php’); $privatekey = file_get_contents(‘private.key’); $rsa = new Crypt_RSA(); $rsa->loadKey($privatekey); $plaintext = new Math_BigInteger(‘aaaaaa’); echo $rsa->_exponentiate($plaintext)->toBytes(); ?>
Citing on Wiki The RSA SecurID authentication mechanism consists of a “token” — either hardware (e.g. a USB dongle) or software (a soft token) — which is assigned to a computer user and which generates an authentication code at fixed intervals (usually 60 seconds) using a built-in clock and the card’s factory-encoded random key (known … Read more
In practice and with respect to security, no, mathematically, yes. If you have a private key (N, D), there is algebraically an infinite number of solutions to the equation 1 = E*D (mod Phi(N)). However, if you make two such solutions (E, N) and (E’, N) that both satisfy the equation public, you will have … Read more
The size of a RSA key is expressed in bits, not bytes. 2048 bits are 256 bytes. A bare-bone RSA private key consists in two integers, the modulus (a big composite integer, its length in bits is the “RSA key length”) and the private exponent (another big integer, which normally has the same size than … Read more
Use the -C option to provide a new comment with your key.
In RSA you should use the public key for encryption and the private key for decryption. Your sample code uses for encryption and decryption the public key – this can not work. Hence in the decryption part you should initialize the cipher this way: cipher1.init(Cipher.DECRYPT_MODE, privateKey); Furthermor your code has a second significant bug: You … Read more
RSA doesn’t pick from a list of known primes: it generates a new very large number, then applies an algorithm to find a nearby number that is almost certainly prime. See this useful description of large prime generation): The standard way to generate big prime numbers is to take a preselected random number of the … Read more
I think this is what you are looking for: http://code.google.com/p/seek-for-android/wiki/BTPCSC
You can generate a public-private keypair with the genrsa context (the last number is the keylength in bits): openssl genrsa -out keypair.pem 2048 To extract the public part, use the rsa context: openssl rsa -in keypair.pem -pubout -out publickey.crt Finally, convert the original keypair to PKCS#8 format with the pkcs8 context: openssl pkcs8 -topk8 -inform … Read more