Replying to Avatar semisol

GF(p)

peepee?

Reply to this note

Please Login to reply.

Discussion

AKA modular arithmetic over a prime, which is also the backbone of all modern cryptography

i'm a big fan of monsieur Galois

finite fields are the foundation of cryptographic security from the combinatorial infeasibility of iteration

the roots are important though... the bigger, the more ways it can collide with another field and problems

Who is monsieur Galois

https://en.wikipedia.org/wiki/%C3%89variste_Galois

there was lots of french guys who grokked math in a big way in that time... another one is ... hmmm i consider him to be the grandfather of chaos theory... uhmmmm

shit it's on the tip of my tongue, halp

ok there's "laplace"

and uhm what others... damn, been too long since i read the chaos math book

i propose the creation of a new symbol Y which means "https://en.wikipedia.org/wiki/Galois_field over a prime (p)"

GF(p) is an easy way to say that

where p is the number of elements

GF(p^2) I think would be a 2 dimensional space