Advances in Cryptology: Proceedings of EUROCRYPT 84, a Workshop on the Theory and Application of Cryptographic Techniques, Paris, France, April 9-11, 1984Thomas Beth, Norbert Cot, Ingemar Ingemarsson |
Contents
Cryptology and Complexity Theories | 3 |
On Cryptosystems based on Polynomials and Finite Fields | 10 |
Algebraical Structures of Cryptographic Transformations | 16 |
Copyright | |
32 other sections not shown
Other editions - View all
Common terms and phrases
asymptotic authentication basic binary bits Blum integer cascade connection chip choose cipher ciphertext coefficients communication complexity compute congruences Coppersmith Cray Cray X-MP cryptanalysis cryptographic deciphering decryption defined denote digital signature discrete logarithms distribution elements enciphering encipherment encryption example factor base fields GF finite fields function Gaussian elimination GF q GF(q given implementation index-calculus algorithm input integer irreducible factors irreducible polynomials key scheduling key-variable large prime layer Lemma LFSR linear equations m₁ matrix method modulo multiplication Oblivious Transfer obtain operations oracle output pairs permutation plaintext polynomials of degrees probability problem proof protection protocol public key cryptosystem quadratic residue quadratic sieve random result RSA's S-boxes Sandia secrecy sequence shift registers signature scheme smart card solve step string subliminal channel subset Theorem Theory values vector w₂(x