A deep dive into using advanced mathematics and neural networks to attack Bitcoin wallets, focusing on elliptic curves and unique properties of Bitcoin's prime number.
About:
Murage Kibicho is a math researcher and programmer interested in tech and academic papers.
Website:
Specializations:
Interests:
Subscribe to RSS:
The blog post discusses Semaev's Naive Index Calculus for solving the Elliptic Curve Discrete Logarithm Problem (ECDLP). It outlines the challenges of applying index calculus techniques to elliptic curves, contrasting them with in...
Advancements in lattice attacks on quantum-safe cryptography are explored, highlighting techniques to improve success rates by guessing secret key bits and decomposing them into batches.
The post delves into the Hidden Number Problem's significance in post-quantum cryptography, detailing its complexities and practical coding solutions for recovering secret keys.
A new algorithm for solving discrete logarithms using Gaussian integers is introduced, with practical coding examples and insights into its application in Bitcoin.
The blog post discusses the advancements in the softmax function as presented in the 2018 paper by Milakov & Gimelshein. It highlights the limitations of the naive softmax, such as overflow and underflow issues, and introduces a s...
The blog post discusses IBM's patent on the use of derivatives to find convergents of generalized continued fractions, a mathematical technique that has existed for over 200 years. It critiques a 2021 paper that rebrands continued...
The blog post discusses the implementation of a Diffusion Transformer (DiT) model for video generation, building on the concepts from the paper 'Scalable Diffusion Models with Transformers' by Peebles & Xie (2023). It details the ...
The blog post discusses advanced techniques for hacking dormant Bitcoin wallets protected by the secp256k1 elliptic curve. It outlines the author's journey through various chapters of a book focused on elliptic curves, detailing t...
The blog post introduces Chebyshev polynomials, highlighting their significance in numerical analysis, approximation theory, and AI applications. It discusses their properties, such as orthogonality and rapid convergence, and prov...
The ACGS algorithm offers a polynomial-time solution for Hidden Number Problems with Chosen Multipliers, enhancing cryptographic techniques through efficient secret recovery methods.
The post details the use of the Sinkhorn-Knopp algorithm in Sudoku solving through Belief Propagation, showcasing its effectiveness and providing implementation insights.
The blog post discusses the 1994 paper 'Factoring with Two Large Primes' by Lenstra & Manasse, which formalizes the use of large primes in the relation collection phase of index calculus. It highlights the efficiency gains of usin...
This post explores the Xedni calculus attack on elliptic curves, detailing its methodology and the challenges faced in practical implementations.
The article discusses the Sinkhorn-Knopp algorithm, which is used to balance the rows and columns of a matrix to sum to 1, akin to a probability distribution. It provides a detailed C implementation of the algorithm, including ste...
The blog post details the author's experience of utilizing free GPU credits from Runpod to learn CUDA by building a big integer library. It discusses the implementation of arithmetic operations for 256-bit integers, comparing the ...
The post explains the GLV endomorphism for efficient scalar multiplication on elliptic curves, detailing techniques and providing Python code examples.
The blog post introduces the Gaudry-Schost algorithm, an alternative to Pollard Rho for collision finding in discrete logarithms. It summarizes the 2004 paper by Gaudry and Schost, which reformulates the Birthday Paradox to detect...
This blog post is part of a series on Practical Index Calculus for Computer Programmers, focusing on finding anomalous elliptic curves. It discusses the Smart attack on elliptic curves, specifically those where the trace of Froben...
The post critiques the overuse of the term 'orthogonal' in conversations, particularly among tech professionals in Silicon Valley. It discusses the term's meaning, its prevalence in certain circles, and suggests that using it does...
This post presents a Python coding implementation of the Extended Hidden Number Problem, aiding programmers in understanding advanced cryptographic concepts.
The blog post discusses how to use Google Colab to learn CUDA programming without needing to invest in expensive hardware. The author, who has no prior experience with Python and is currently unemployed due to funding cuts, shares...
Utilize Google Colab's free GPUs for CUDA programming with accessible resources and tutorials for budget-conscious developers.
The text is a subscription request for LeetArxiv, a newsletter aimed at engineers, engineering managers, AI researchers, and ML practitioners. The author highlights the newsletter's value in providing informative coding guides and...