3.5. Arithmetic in Finite Fields
Many cryptographic protocols are based on the (apparent) intractability of the discrete logarithm problem (Section 4.2) in the multiplicative group of a finite field 
. The arithmetic of the finite fields 
, 
, and 
, 
, is ...
Get Public-key Cryptography: Theory and Practice now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
