Dear specialists! I need your help.
Can you advise me any material about how to test arithmetic operations with big numbers?
What key areas should I pay attention?
What typical development errors there are in this area?
It will help me to pass my examinations.
Thanks in advance.
I'm sorry for using caps, I didn't know about this rule and just wanted to emphasize the general question.
In my classes I learn cryptography theory. And I have a task:
Suppose we have a realisation of any cryptographic algorithm. This realisation uses it's own arithmetic operators to operate with big numbers.
I should create test cases for testing correctness arithmetic operations. Also I should to classify this test cases and prove this classification.
You have learned cryptography theory and I assume that you learned about cryptographic algorithms. What you need to think about is what you would do with this information to test out your arithmetic operations. From these things you have the knowledge - you now need to think on how you would use that knowledge to verify or test.
There are no typical development errors - and you are not really looking for errors you are looking to prove that what you are testing meets the requirements - while doing this you may find error or defects that prove that, until these are fixed, what you are testing does not meet the requirements.
I have not failed. I've just found 10,000 ways that won't work" --Thomas Edison