What people are saying - Write a review
We haven't found any reviews in the usual places.
Cryptology and Complexity Theories
On Cryptosystems based on Polynomials and Finite Fields
Algebraical Structures of Cryptographic Transformations
31 other sections not shown
Other editions - View all
5-boxes applications asymptotic authentication basic binary bits cascade connection chip choose cipher ciphertext coefficients complexity congruences continued fraction Cray Cray X-MP cryptanalysis cryptographic deciphering decryption defined denote digital signature discrete logarithms distribution elements enciphering encipherment encryption example factor base fields GF(p finite fields function Gaussian elimination GF(q given idempotent implementation index-calculus algorithm input integer irreducible factors irreducible polynomials key scheduling key-variable l.OOOOOE+00 large prime Lemma LFSR linear equations matrix method modular modulo multiplication Oblivious Transfer obtain operations oracle output pairs permutation plaintext polynomials of degrees probability problem proof properties protection protocol public key cryptosystem quadratic residue quadratic sieve random result RSA's l.s.b secret key sequence shift registers signature scheme smart card solve step string subliminal channel subset Theorem Theory values vector