◆PREY NEXT◆ [Page x刈 Notation Even the natives have difficulty mastering this peculiar vocabulary. The Golden Bough,Sir James George Frazer Symbol Expression Meaning D,K D(K,Y) Symmetric decryption of ciphertext Yusing secret key K. D,PRa D(PRa.Y) Asymmetric decryption of ciphertext Yusing A's private key PRa D,PUa D(PUa.Y) Asymmetric decryption of ciphertext Yusing A's public key PUa E,K E(K,9 Symmetric encryption of plaintext X using secret key K. E.PRa E(PRa.X) Asymmetric encryption of plaintext X using A's private key PRa E,PUa E(PUa.X) Asymmetric encryption of plaintext X using A's public key PUa K Secret key PRa Private key of user A PUa Public key of user A C.K C(K,X) Message authentication code of messageX using secret key K. GF(p) The finite field of order p.where p is prime.The field is defined as the set Zp together with the arithmetic operations modulop. GF(2 The finite field of order2 Zn Set of nonnegative integers less thann gcd gcd〔，) Greatest common divisor;the largest positive integer that divides bothi and jwith no remainder on division. mod amodm Remainder after division of a by m. mod,≡ a三b(mod m) a mod m b mod m mog美 ,丰kmo8m a mod m≠6mdnm dlog dloga.p(b) Discrete logarithm of the numberb for the basea(mod p) f f The number of positive integers less than n and relatively prime ton. This is Euler's totient function. 和 a1+a2+.+an[Page xi] Notation Even the natives have difficulty mastering this peculiar vocabulary. The Golden Bough, Sir James George Frazer Symbol Expression Meaning D, K D(K, Y) Symmetric decryption of ciphertext Y using secret key K. D, PRa D(PRa, Y) Asymmetric decryption of ciphertext Y using A's private key PRa D,PUa D(PUa, Y) Asymmetric decryption of ciphertext Y using A's public key PUa E, K E(K, X) Symmetric encryption of plaintext X using secret key K. E, PRa E(PRa, X) Asymmetric encryption of plaintext X using A's private key PRa E, PUa E(PUa, X) Asymmetric encryption of plaintext X using A's public key PUa K Secret key PRa Private key of user A PUa Public key of user A C, K C(K, X) Message authentication code of message X using secret key K. GF(p) The finite field of order p, where p is prime. The field is defined as the set Zp together with the arithmetic operations modulo p. GF(2 n ) The finite field of order 2 n . Zn Set of nonnegative integers less than n gcd gcd(i, j) Greatest common divisor; the largest positive integer that divides both i and j with no remainder on division. mod a mod m Remainder after division of a by m. mod, a b(mod m) a mod m = b mod m mod, a b(mod m) a mod m b mod m dlog dloga,p(b) Discrete logarithm of the number b for the base a (mod p) f f(n) The number of positive integers less than n and relatively prime to n. This is Euler's totient function. S a1 + a2 + ... + an