all InfoSec news
On the notion of carries of numbers $2^n-1$ and Scholz conjecture
Dec. 31, 2023, 8:42 a.m. |
IACR News www.iacr.org
ePrint Report: On the notion of carries of numbers $2^n-1$ and Scholz conjecture
Theophilus Agama
Applying the pothole method on the factors of numbers of the form $2^n-1$, we prove that if $2^n-1$ has carries of degree at most $$\kappa(2^n-1)=\frac{1}{2(1+c)}\lfloor \frac{\log n}{\log 2}\rfloor-1$$ for $c>0$ fixed, then the inequality $$\iota(2^n-1)\leq n-1+(1+\frac{1}{1+c})\lfloor\frac{\log n}{\log 2}\rfloor$$ holds for all $n\in \mathbb{N}$ with $n\geq 4$, where $\iota(\cdot)$ denotes the length of the shortest addition chain producing $\cdot$. In general, we show that all numbers …
More from www.iacr.org / IACR News
Postdoctoral Researcher
1 day, 9 hours ago |
www.iacr.org
Blink: An Optimal Proof of Proof-of-Work
2 days, 8 hours ago |
www.iacr.org
PN-based Attacks in the White-box Setting
2 days, 8 hours ago |
www.iacr.org
Succinct Functional Commitments for Circuits from k-Lin
2 days, 14 hours ago |
www.iacr.org
Levin–Kolmogorov Complexity is not in Linear Time
2 days, 14 hours ago |
www.iacr.org
Unstructured Inversions of New Hope
2 days, 14 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Junior Cybersecurity Analyst - 3346195
@ TCG | 725 17th St NW, Washington, DC, USA
Cyber Intelligence, Senior Advisor
@ Peraton | Chantilly, VA, United States
Consultant Cybersécurité H/F - Innovative Tech
@ Devoteam | Marseille, France
Manager, Internal Audit (GIA Cyber)
@ Standard Bank Group | Johannesburg, South Africa
Staff DevSecOps Engineer
@ Raft | San Antonio, TX (Local Remote)
Domain Leader Cybersecurity
@ Alstom | Bengaluru, KA, IN