Permutation Polynomials in RSA-Cryptosystems. - Rudolf Lidl; Winfried B. Müller (CRYPTO, 1983)

On Cryptosystems Based on Polynomials and Finite Fields. - Rudolf Lidl (EUROCRYPT, 1984)

On Decomposable and Commuting Polynominals. - Rudolf Lidl (European Conference on Computer Algebra (2), 1985)

Breaking the Cade Cipher. - N. S. James; Rudolf Lidl; Harald Niederreiter (CRYPTO, 1986)

A Cryptanalytic Attack on the CADE Cryptosystem. - N. S. James; Rudolf Lidl; Harald Niederreiter (EUROCRYPT, 1986)

A Note on Strong Fibonacci Pseudoprimes. - Rudolf Lidl; Winfried B. Müller (AUSCRYPT, 1990)

Some Remarks on Strong Fibonacci Pseudoprimes. - Rudolf Lidl; Winfried B. Müller; Alan Oswald (Appl. Algebra Eng. Commun. Comput., 1990)

Computational Problems in the Theory of Finite Fields. - Rudolf Lidl (Appl. Algebra Eng. Commun. Comput., 1991)

Generalizations of the Fibonacci pseudoprimes test. - Rudolf Lidl; Winfried B. Müller (Discret. Math., 1991)

Primality Testing with Lucas Functions. - Rudolf Lidl; Winfried B. Müller (AUSCRYPT, 1992)

Several variables. - Rudolf Lidl; Gary L. Mullen (Handbook of Finite Fields, 2013)