![]() Here is the documentation of constructor for BigInteger class which show I have to use bye array byte if I want to specify it manually and if I do so then there is no way to generate it randomly. Then how can I specify the difference such that such that it is larger than 2^512? Then I think I would no longer be able to generate p and q randomly ? Question: What I am wondering is that I specified the bit length of p and q, and also SecureRandom instance to generate them randomly, But what I am told is that the difference may not be larger than 2^512. The difference of two primes should be bigger than 2^512 (for security) ![]() RSA works on the fact that it is very hard to factorize large numbers (order of 100+ digits). ![]() ![]() The prime numbers p and q should be at least 1024-bit RSA is an asymmetric cryptographic algorithm which is used for encryption purposes so that only the required sources should know the text and no third party should be allowed to decrypt the text as it is encrypted. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |