Complexity analysis of a top down algorithm motivated by power product expansions

DOI10.1080/09720529.2016.1190565MaRDI QIDQ5031877zbMATH OpenOpenAlexWikidataFDO

Authors Jocelyn Quaintance, H. Gingold

Publication date 16 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2016.1190565

zbMATH Keywords

cryptosystemsDiophantine equationsexpansionsgeneralized integer power productsgeneralized power productspartitionspower productspower seriessecuritytop-down algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Computer solution of Diophantine equations (11Y50) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Dictionary based codes involving power product expansions
• Dictionary coding via perfect polynomials
• scientific article; zbMATH DE number 1839603
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
• Algebraic dependence in generating functions and expansion complexity

Cites work

• An Introduction to Mathematical Cryptography
• scientific article; zbMATH DE number 3843822 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 3208366 (Why is no real title available?)

Cited in

(2)

• Dictionary based codes involving power product expansions
• Dictionary coding via perfect polynomials

This page was built for publication: Complexity analysis of a top down algorithm motivated by power product expansions

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