Some results on an encryption method using subset-sums of pseudo-recursive sequences

DOI10.47443/dml.2021.0019zbMath1499.11037OpenAlexW4233946990WikidataQ121326846 ScholiaQ121326846MaRDI QIDQ5862689

Bence Bakos, Máté Pálfy

Publication date: 9 March 2022

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2021.0019

zbMATH Keywords

Cantor representation of integerssubset-sumsencoding a codeword

Mathematics Subject Classification ID

Cryptography (94A60) Additive bases, including sumsets (11B13)

Related Items (1)

On arithmetic sums of Cantor-type sequences of integers

Cites Work

• Unnamed Item
• Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
• Some remarks on a problem of Erdős and Graham
• Subset sums in ℕ²

This page was built for publication: Some results on an encryption method using subset-sums of pseudo-recursive sequences