Runs of Ones in Binary Strings
F Balado, G Silvestre - arXiv preprint arXiv:2302.11532, 2023 - arxiv.org
arXiv:2302.11532v2 [math.CO] 26 Feb 2023 Page 1 Runs of Ones in Binary Strings Félix
Balado and Guénolé Silvestre School of Computer Science University College Dublin, Ireland …
Balado and Guénolé Silvestre School of Computer Science University College Dublin, Ireland …
A review of approximate message authentication codes
SAH Tabatabaei, N Živić - Robust image authentication in the presence of …, 2015 - Springer
This chapter gives a brief and concrete literature study on approximate message
authentication methods. The existing approaches are categorized based on their design …
authentication methods. The existing approaches are categorized based on their design …
[PDF][PDF] Counting runs of ones with overlapping parts in binary strings ordered linearly and circularly
FS Makri, ZM Psillakis, AN Arapis - International Journal of …, 2013 - researchgate.net
Abstract On a binary (0− 1) string of length n the l-overlapping counting scheme of runs of 1
s of a fixed length k is considered. According to this scheme, a run of 1s of length k which is …
s of a fixed length k is considered. According to this scheme, a run of 1s of length k which is …
Revisiting a primitive: analysis of approximate message authentication codes
SA Hossein, AE Tabatabaei… - 2014 IEEE International …, 2014 - ieeexplore.ieee.org
In this paper, a well-known algorithm of approximate message authentication code (AMAC),
its generalized scheme and its improved version are reconsidered. Weaknesses are …
its generalized scheme and its improved version are reconsidered. Weaknesses are …