Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Cryptography - Modulus of a Polynomial

Status
Not open for further replies.
S

senthilvadivu

Newbie level 1
Joined
Nov 24, 2005
Messages
0
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,280
Activity points
1,303
Hi,
I am not sure if this is a right forum to ask this.
how to calculate (x + 1) mod (x³ + 1) am giving small values but actually i want to know the procedure to take poly.
Thanks
 

The resul will be (x+1) because its degree is less than degree of polynomial (x^3+1)

For example x^5+x^4 +x^2+1(mod(x^3+1))=-x^2-x+x^2+1=-x+1

Algorithm is dividing polynomials, it is similar to algorithm of dividing real numbers
See R.Blahut "Art of Error Correcting Codes"
or similar books
 

Hi ,
Thanks for reply.
I didnot mention one thing. THis is in galois field.
i want to know the ans and procedure for this.

(x^4 + x^3 + x^2 + x + 1) mod (x^8 + 1)
in GF(2 ^ 8)

Thanks
Senthil
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top