On subset sums of pseudo-recursive sequences

Bence Bakos; Norbert Hegyv a´ri; Ma´ te´ Pa´ lfy; Xiao-Hui Yan

Author(s)

Bence Bakos ELTE TTK, Eo ̈tvo ̈s University, Institute of Mathematics,H-1117 P a ́zm a ́ny st. 1/c, Budapest,Hungary

Norbert Hegyv a´ri ELTE TTK, Eo ̈tvo ̈s University, Institute of Mathematics,H-1117 P a ́zm a ́ny st. 1/c, Budapest,Hungary

Ma´ te´ Pa´ lfy ELTE TTK, Eo ̈tvo ̈s University, Institute of Mathematics,H-1117 P a ́zm a ́ny st. 1/c, Budapest,Hungary

Xiao-Hui Yan Nanjing Normal University,Nanjing, Jiangsu,China

Abstract

Let a0 = a ∈ N, {Mi} ∞i=1 be an infinite set of integers and {b1, b2, . . . , bk} be a finite set of integers. We say that {ai} ∞i=0is a pseudo-recursive sequence if an+1 = Mn+1an + bjn+1 (bjn+1 ∈ {b1, b2, . . . bk}) holds. In the first part of the paper, we investigate the subset sum of a generalized version of Aα := {an = b2 nαc : n = 0, 1, 2, . . . }, which is a special pseudorecursive sequence. In the second part, we use Aα for an encryption algorithm.

Publication Details

Page(s) 31-36

DOI DOI not available

Published Journal: Discrete Mathematics Letters, Volume: 4, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords

encoding a codeword, Cantor's representation of integers, subset sums

References

Brickell E. F.,Odlyzko A. M. .1988 .Cryptanalysis: a survey of recent results. Proc. IEEE, 76 : 578-593.

Cantor G.,Angew Z. .1869 .. , 14 : 121-128.

Erdo P. .1968 .˝s, Geometrical and set-theoretical properties of subsets of Hilbert-space (in Hungarian). Mat. Lapok, 19 : MR40-258.

Hegyva N. .1989 .´ri, Some remarks on a problem of Erdo˝s and Graham. Acta Math. Hungar, 53 : 149-154.

Impagliazzo R.,Naor M. .1989 .Efficient cryptographic schemes provably as secure as subset sum. Proc. 30th IEEE Symposium on Foundations of Computer Science, : 236-241.