SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k

DOI10.58250/JNANABHA.2023.53209MaRDI QIDQ6136919zbMATH OpenOpenAlexWikidataFDO

Authors Pinkimani Goswami, Madan Mohan Singh

Publication date 18 January 2024

Published in jnanabha (Search for Journal in Brave)

Full work available at URL https://doi.org/10.58250/jnanabha.2023.53209

zbMATH Keywords

discrete logarithm problemDickson polynomialinteger factorization problemencryption schemediscrete Dickson problem

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06)

Recommendations

• scientific article; zbMATH DE number 4081459
• Cryptanalysis of public-key distribution systems based on Dickson polynomials
• Cryptanalysis of the Dickson-Scheme
• Cryptosystems based on permutation polynomials
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)

This page was built for publication: SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k

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