all InfoSec news
A proof of the Scholz conjecture on addition chains
Jan. 19, 2023, 9:18 p.m. |
IACR News www.iacr.org
ePrint Report: A proof of the Scholz conjecture on addition chains
Theophilus Agama
Applying the pothole method on the factors of numbers of the form $2^n-1$, we prove the inequality $$\iota(2^n-1)\leq n-1+\iota(n)$$ where $\iota(n)$ denotes the length of the shortest addition chain producing $n$.
addition agama eprint report length numbers producing prove report
More from www.iacr.org / IACR News
Postdoctoral Researcher
1 day, 7 hours ago |
www.iacr.org
Blink: An Optimal Proof of Proof-of-Work
2 days, 7 hours ago |
www.iacr.org
PN-based Attacks in the White-box Setting
2 days, 7 hours ago |
www.iacr.org
Succinct Functional Commitments for Circuits from k-Lin
2 days, 13 hours ago |
www.iacr.org
Levin–Kolmogorov Complexity is not in Linear Time
2 days, 13 hours ago |
www.iacr.org
Unstructured Inversions of New Hope
2 days, 13 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