On Using Prime Polynomials in Crypto Generators

DOI10.1007/3-540-39466-4_14zbMATH Open0503.94016OpenAlexW2127047858MaRDI QIDQ4739792FDOQ4739792

Authors: Tore Herlestam 

Publication date: 1983

Published in: Cryptography (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 872088
• scientific article; zbMATH DE number 3957197
• scientific article; zbMATH DE number 3888784
• Large primes in stream cipher cryptography
• scientific article; zbMATH DE number 697832

zbMATH Keywords

finite fieldprimality testprime polynomialscrypto generators

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Cited In (2)

• Large primes in stream cipher cryptography
• (Imperfect) strategies to generate primitive polynomials over GF(2)

This page was built for publication: On Using Prime Polynomials in Crypto Generators

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