Brier, Eric; Naccache, David; Yifrach-Stav, Ofer A Note on the Ramanujan Machine. arXiv:2211.01058 Preprint, arXiv:2211.01058 [math.NT] (2022). BibTeX Cite \textit{E. Brier} et al., ``A Note on the Ramanujan Machine'', Preprint, arXiv:2211.01058 [math.NT] (2022) Full Text: arXiv OA License
Brier, Eric; Clavier, Christophe; Gutsche, Linda; Naccache, David The Multiplicative Persistence Conjecture Is True for Odd Targets. arXiv:2110.04263 Preprint, arXiv:2110.04263 [math.NT] (2021). BibTeX Cite \textit{E. Brier} et al., ``The Multiplicative Persistence Conjecture Is True for Odd Targets'', Preprint, arXiv:2110.04263 [math.NT] (2021) Full Text: arXiv OA License
Brier, Éric; Ferradi, Houda; Joye, Marc; Naccache, David New number-theoretic cryptographic primitives. (English) Zbl 1465.94059 J. Math. Cryptol. 14, 224-235 (2020). Reviewer: Jaak Henno (Tallinn) MSC: 94A60 11T71 11A15 11R18 PDFBibTeX XMLCite \textit{É. Brier} et al., J. Math. Cryptol. 14, 224--235 (2020; Zbl 1465.94059) Full Text: DOI
Brier, Éric; Géraud-Stewart, Rémi; Naccache, David A Fractional \(3n+1\) Conjecture. arXiv:2006.11634 Preprint, arXiv:2006.11634 [math.DS] (2020). BibTeX Cite \textit{É. Brier} et al., ``A Fractional $3n+1$ Conjecture'', Preprint, arXiv:2006.11634 [math.DS] (2020) Full Text: arXiv OA License
Brier, Éric; Géraud-Stewart, Rémi; Naccache, David; Pacco, Alessandro; Troiani, Emanuele The Look-and-Say The Biggest Sequence Eventually Cycles. arXiv:2006.07246 Preprint, arXiv:2006.07246 [math.DS] (2020). BibTeX Cite \textit{É. Brier} et al., ``The Look-and-Say The Biggest Sequence Eventually Cycles'', Preprint, arXiv:2006.07246 [math.DS] (2020) Full Text: arXiv OA License
Brier, Éric; Géraud-Stewart, Rémi; Naccache, David; Pacco, Alessandro; Troiani, Emanuele Stuttering Conway Sequences Are Still Conway Sequences. arXiv:2006.06837 Preprint, arXiv:2006.06837 [math.DS] (2020). BibTeX Cite \textit{É. Brier} et al., ``Stuttering Conway Sequences Are Still Conway Sequences'', Preprint, arXiv:2006.06837 [math.DS] (2020) Full Text: arXiv OA License
Brier, Eric; Naccache, David; Xia, Li-Yao How to sign paper contracts? Conjectures and evidence related to equitable and efficient collaborative task scheduling. (English) Zbl 1314.68083 Koç, Çetin Kaya (ed.), Open problems in mathematics and computational science. Based on the presentations at the conference, Istanbul, Turkey, September 18–20, 2013. Cham: Springer (ISBN 978-3-319-10682-3/hbk; 978-3-319-10683-0/ebook). 317-340 (2014). MSC: 68M20 PDFBibTeX XMLCite \textit{E. Brier} et al., in: Open problems in mathematics and computational science. Based on the presentations at the conference, Istanbul, Turkey, September 18--20, 2013. Cham: Springer. 317--340 (2014; Zbl 1314.68083) Full Text: DOI
Brier, Eric; Naccache, David; Tibouchi, Mehdi Factoring unbalanced moduli with known bits. (English) Zbl 1305.94035 Lee, Donghoon (ed.) et al., Information, security and cryptology – ICISC 2009. 12th international conference, Seoul, Korea, December 2–4, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-14422-6/pbk). Lecture Notes in Computer Science 5984, 65-72 (2010). MSC: 94A60 PDFBibTeX XMLCite \textit{E. Brier} et al., Lect. Notes Comput. Sci. 5984, 65--72 (2010; Zbl 1305.94035) Full Text: DOI
Brier, Eric; Clavier, Christophe; Coron, Jean-Sébastien; Naccache, David Cryptanalysis of RSA signatures with fixed-pattern padding. (English) Zbl 1003.94523 Kilian, Joe (ed.), Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2139, 433-439 (2001). MSC: 94A60 PDFBibTeX XMLCite \textit{E. Brier} et al., Lect. Notes Comput. Sci. 2139, 433--439 (2001; Zbl 1003.94523) Full Text: Link