Comparing balanced sequences obtained from ElGamal function to random balanced sequences

DOI10.1007/s12095-022-00623-1arXiv2112.12032OpenAlexW4321015079MaRDI QIDQ6107462

Lucas Pandolfo Perin, Daniel Panario, Brett Stevens

Publication date: 3 July 2023

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.12032

zbMATH Keywords

sequencesrandom permutationsGolomb's randomness postulates

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Asymptotic enumeration (05A16) Sequences (mod (m)) (11B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions
• APN permutations on \(\mathbb Z_n\) and Costas arrays
• Covering arrays from cyclotomy
• On the measurement of the (non)linearity of Costas permutations
• Artin's conjecture for primitive roots
• Covering arrays from \(m\)-sequences and character sums
• Handbook of Finite Fields
• Costas Arrays
• A Remark on Stirling's Formula
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Artin's Primitive Root Conjecture – A Survey
• On the Nonlinearity of Exponential Welch Costas Functions

This page was built for publication: Comparing balanced sequences obtained from ElGamal function to random balanced sequences