Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Weger, Benne"'
Autor:
de Weger, Benne
This paper reports on experiments searching for elliptic curves over Q with large Tamagawa products. The main idea is to look among curves related to good abc-triples.
Externí odkaz:
http://arxiv.org/abs/2301.03050
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coeffici
Externí odkaz:
http://arxiv.org/abs/1707.06893
Autor:
Laarhoven, Thijs, de Weger, Benne
Publikováno v:
ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec), pp. 13-18, 2013
The Tardos scheme is a well-known traitor tracing scheme to protect copyrighted content against collusion attacks. The original scheme contained some suboptimal design choices, such as the score function and the distribution function used for generat
Externí odkaz:
http://arxiv.org/abs/1302.1741
Autor:
Laarhoven, Thijs, de Weger, Benne
Publikováno v:
Indagationes Mathematicae, vol. 24, no. 4, pp. 971-983, 2013
We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz graph, th
Externí odkaz:
http://arxiv.org/abs/1209.3495
With the growing amount of personal information exchanged over the Internet, privacy is becoming more and more a concern for users. One of the key principles in protecting privacy is data minimisation. This principle requires that only the minimum am
Externí odkaz:
http://arxiv.org/abs/1206.7111
Publikováno v:
IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4230-4242, 2013
We construct binary dynamic traitor tracing schemes, where the number of watermark bits needed to trace and disconnect any coalition of pirates is quadratic in the number of pirates, and logarithmic in the total number of users and the error probabil
Externí odkaz:
http://arxiv.org/abs/1111.3597
Autor:
Laarhoven, Thijs, de Weger, Benne
Publikováno v:
Designs, Codes and Cryptography, vol. 71, no. 1, pp. 83-103, 2014
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Skoric et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times
Externí odkaz:
http://arxiv.org/abs/1107.3441
Publikováno v:
Publ. Math. Debrecen 78/2 (2011), 377-392
We show that the equation in the title (with $\Phi_m$ the $m$th cyclotomic polynomial) has no integer solution with $n\ge 1$ in the cases $(m,p)=(15,41), (15,5581),(10,271)$. These equations arise in a recent group theoretical investigation by Z. Akh
Externí odkaz:
http://arxiv.org/abs/0907.5323
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Laarhoven, Thijs, de Weger, Benne
Publikováno v:
In Indagationes Mathematicae 15 November 2013 24(4):971-983
