This project implements the second type of finite field GF(p^n) where p is a prime number and n is positive integer.
The attachments are the instruction ([login to view URL]), the pseudo-codes of PLDA (Polynomial Long Division Algorithm) and EEAP (Extended Euclidean Algorithm for Polynomials), and the sample data. You can (but not have to, you can write your own java source codes of PLDA and EEAP) write the java source codes of PLDA and EEAP based on the attached pseudo-codes. Don't forget to use the sample data to verify the correctness of your code before submitting it. You can also use the addition, subtraction, multiplication, and division tables on the lecture notes to test your code
I can do this task for you.I can do this task for you.I can do this task for you.I can do this task for you.I can do this task for you.I can do this task for you.
I am an IITK graduate, 9 year experienced software professional and I have got top notch developers in my team, who have got experience across a span of technologies. The members in my team have worked with top notch tech organization such as Amazon, Cisco, Oracle etc. We have been involved in similar projects in the past and our track record has been excellent.
I am certified in Java, I have over 10 years of programming experience. I am responsible and I like to do things right and in the stipulated time . Here there are the attachments that you mention. I need the files mentioned to better understand what you need.