Pseudorandom binary functions on almost uniform trees

Katalin Gyarmati, Pascal Hubert, A. Sárközy

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

First the notion of r-almost s-uniform tree is introduced which includes both the case of finitely generated free groups and uniform binary trees as special cases. The goal of the paper is to study pseudorandomness of binary functions defined on r-almost s-uniform trees. The measures of pseudorandomness of binary functions are introduced; the connection between these measures is analyzed; the size of these measures for truly random binary functions is studied; binary functions with strong pseudorandom properties are constructed.

Original languageEnglish
Title of host publicationFrontiers of Combinatorics and Number Theory
PublisherNova Science Publishers, Inc.
Pages1-26
Number of pages26
Volume2
ISBN (Electronic)9781620811399
ISBN (Print)9781619429185
Publication statusPublished - Jan 1 2012

Fingerprint

Binary
Pseudorandomness
Finitely Generated Group
Binary Tree
Free Group

Keywords

  • Binary function
  • Correlation
  • Legendre symbol
  • Pseudorandom
  • Uniform tree

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Gyarmati, K., Hubert, P., & Sárközy, A. (2012). Pseudorandom binary functions on almost uniform trees. In Frontiers of Combinatorics and Number Theory (Vol. 2, pp. 1-26). Nova Science Publishers, Inc..

Pseudorandom binary functions on almost uniform trees. / Gyarmati, Katalin; Hubert, Pascal; Sárközy, A.

Frontiers of Combinatorics and Number Theory. Vol. 2 Nova Science Publishers, Inc., 2012. p. 1-26.

Research output: Chapter in Book/Report/Conference proceedingChapter

Gyarmati, K, Hubert, P & Sárközy, A 2012, Pseudorandom binary functions on almost uniform trees. in Frontiers of Combinatorics and Number Theory. vol. 2, Nova Science Publishers, Inc., pp. 1-26.
Gyarmati K, Hubert P, Sárközy A. Pseudorandom binary functions on almost uniform trees. In Frontiers of Combinatorics and Number Theory. Vol. 2. Nova Science Publishers, Inc. 2012. p. 1-26
Gyarmati, Katalin ; Hubert, Pascal ; Sárközy, A. / Pseudorandom binary functions on almost uniform trees. Frontiers of Combinatorics and Number Theory. Vol. 2 Nova Science Publishers, Inc., 2012. pp. 1-26
@inbook{0070b98cf0a047b7a33d3c16b5bac040,
title = "Pseudorandom binary functions on almost uniform trees",
abstract = "First the notion of r-almost s-uniform tree is introduced which includes both the case of finitely generated free groups and uniform binary trees as special cases. The goal of the paper is to study pseudorandomness of binary functions defined on r-almost s-uniform trees. The measures of pseudorandomness of binary functions are introduced; the connection between these measures is analyzed; the size of these measures for truly random binary functions is studied; binary functions with strong pseudorandom properties are constructed.",
keywords = "Binary function, Correlation, Legendre symbol, Pseudorandom, Uniform tree",
author = "Katalin Gyarmati and Pascal Hubert and A. S{\'a}rk{\"o}zy",
year = "2012",
month = "1",
day = "1",
language = "English",
isbn = "9781619429185",
volume = "2",
pages = "1--26",
booktitle = "Frontiers of Combinatorics and Number Theory",
publisher = "Nova Science Publishers, Inc.",

}

TY - CHAP

T1 - Pseudorandom binary functions on almost uniform trees

AU - Gyarmati, Katalin

AU - Hubert, Pascal

AU - Sárközy, A.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - First the notion of r-almost s-uniform tree is introduced which includes both the case of finitely generated free groups and uniform binary trees as special cases. The goal of the paper is to study pseudorandomness of binary functions defined on r-almost s-uniform trees. The measures of pseudorandomness of binary functions are introduced; the connection between these measures is analyzed; the size of these measures for truly random binary functions is studied; binary functions with strong pseudorandom properties are constructed.

AB - First the notion of r-almost s-uniform tree is introduced which includes both the case of finitely generated free groups and uniform binary trees as special cases. The goal of the paper is to study pseudorandomness of binary functions defined on r-almost s-uniform trees. The measures of pseudorandomness of binary functions are introduced; the connection between these measures is analyzed; the size of these measures for truly random binary functions is studied; binary functions with strong pseudorandom properties are constructed.

KW - Binary function

KW - Correlation

KW - Legendre symbol

KW - Pseudorandom

KW - Uniform tree

UR - http://www.scopus.com/inward/record.url?scp=85016725816&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016725816&partnerID=8YFLogxK

M3 - Chapter

SN - 9781619429185

VL - 2

SP - 1

EP - 26

BT - Frontiers of Combinatorics and Number Theory

PB - Nova Science Publishers, Inc.

ER -