On Cryptosystems Based on Polynomials and Finite Fields

DOI10.1007/3-540-39757-4_2MaRDI QIDQ3728812zbMATH OpenOpenAlexFDO

Authors Rudolf Lidl

Publication date 1985

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39757-4_2

zbMATH Keywords

algebraic cryptographyconstruction of cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• A cryptographic system based on finite field transforms
• scientific article; zbMATH DE number 3859027
• scientific article; zbMATH DE number 3941423
• Cryptosystems based on permutation polynomials
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD

Cited in

(35)

• Existence conditions for self-orthogonal negacyclic codes over finite fields
• Some new classes of cyclic codes with three or six weights
• On the mixing properties of operations in a finite field
• Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
• scientific article; zbMATH DE number 691466 (Why is no real title available?)
• Permutation polynomials on matrices
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field Z_N
• scientific article; zbMATH DE number 5226531 (Why is no real title available?)
• Piecewise constructions of inverses of some permutation polynomials
• Compactly supported functions in cryptography algorithms
• A class of p-ary cyclic codes and their weight enumerators
• A colouring protocol for the generalized Russian cards problem
• On a new cipher system over Galois fields of order 27
• A cryptographic system based on finite field transforms
• Explicit constructions of some non-Gabidulin linear maximum rank distance codes
• On the error distance of extended Reed-Solomon codes
• A generic method to construct zero-difference balanced functions
• Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
• Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions
• Permutation polynomials and applications to coding theory
• An extension of binary threshold sequences from Fermat quotients
• Construction and number of self-dual skew codes over \(\mathbb{F}_{p^2}\)
• A geometric protocol for cryptography with cards
• On parameters of subfield subcodes of extended norm-trace codes
• Rank equivalent and rank degenerate skew cyclic codes
• Unified combinatorial constructions of optimal optical orthogonal codes
• On cross-correlation of a binary \(m\)-sequence of period \(2^{2k}-1\) and its decimated sequences by \((2^{lk}+1)/(2^l+1)\)
• Some new results on cross correlation of \(p\)-ary \(m\)-sequence and its decimated sequence
• The weight distributions of constacyclic codes
• An application of algebraic geometry to encryption: tame transformation method
• scientific article; zbMATH DE number 426148 (Why is no real title available?)
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Multiple coverings of the farthest-off points with small density from projective geometry
• Weight distributions of a class of cyclic codes from \(\mathbb F_l\)-conjugates
• More constructions of near optimal codebooks associated with binary sequences

This page was built for publication: On Cryptosystems Based on Polynomials and Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728812)