Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
I was doing RSA private key decrypt,but this big number always give me infinite or NaN,how to calculate it programmably?
Big integers are not primitives in most programming language, but many of them have a BigInt or BigInteger class.
Usually, there are specialized implementation for speeding up that power/modulus operation, rather than a simplistic implementation.
You have to specify the desired programming language for suggesting a complete bit integer library.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 days ago.
The community reviewed whether to reopen this question 6 days ago and left it closed:
Original close reason(s) were not resolved
Improve this question
There are only 32-bit registers on the system, and only the float type can be used, but I want to achieve high-precision floating-point operations.I found that I can use the double-float method such as float-float and Extended-Precision Floating-Point Numbers ，but I am not sure about the error（ULP） generated by comparing the results of these methods with the results of the hardware double operation.Is there a better way to improve the precision of float operation（+，-，*，/）？
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 2 years ago.
Improve this question
Can atomic functions be placed inside if conditions or for loops in OpenCL. If possible can someone provide me with an example kernel?
Yes, they can.
There's no special lock-step requirement for atomic functions like there is for barriers.
It's common to reduce a group-wide result of a calculation, and then only one work-item from the group updates the global buffer with this sub-result.
if (get_local_id(0) == 0)
atomic_add(result_ptr, group_result);
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
What is the difference between function and procedure in PL/SQL?
No, it is not. In PL/SQL functions return data, procedures do not. In C for example both are called functions.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
i have been given to design software.i have designed the overall process using box and arrow notation .i want to know for high level design of software is there any specific notation to follow.
One of the most commonly used notations is UML or Unified Modelling Language.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 9 years ago.
Improve this question
I'm a bit mathematically challenged and have been working on the RSA cipher (good start). I can find the public and private keys and know how to work do modulo operations on a calculator. The problem is that I can't do them when the numbers get to high. For example say I have:
10^541 mod 2923 = C
The numbers involved here become very large and don't display fully on a calculator, if it can even handle the numbers (mine is crap). What I am wondering is if there is a better method to work out the ciphertext or plaintext that will work for largish numbers.
I think http://math.stackexchange.com would be a better place for this question.
But, essentially, don't save the mod for the end. Break the exponentiation up into many smaller operations with mod after each one.