I was asked if I could send a screenshot of my Rust learning project to possibly help to be installed. A server that deals with binary encryption, among other things, is not so simply clear to see
(This is now in the INFO login, it's just for showing the request as a demo and doesn't make sense)
One day, one decomposition
A000069: Odious numbers: numbers with an odd number of 1's in their binary expansion
3D graph, threejs - webGL https://decompwlj.com/3Dgraph/Odious_numbers.html
3D graph Gen, threejs animation https://decompwlj.com/3DgraphGen/Odious_numbers.html
2D graph, first 500 terms https://decompwlj.com/2Dgraph500terms/Odious_numbers.html
One day, one decomposition
A000028: Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.
3D graph, threejs - webGL https://decompwlj.com/3Dgraph/A000028.html
3D graph Gen, threejs animation https://decompwlj.com/3DgraphGen/A000028.html
2D graph, first 500 terms https://decompwlj.com/2Dgraph500terms/A000028.html
Free workshop: ph0wn Labs #3
Nicolas Rouvière, of Ph0wn and SHL, will show you how to use Qiling in practice, for dynamic binary emulation.
Don't miss it! This is on-site only, at SHL, on June 19 at 7pm.
Venue:
Sophia Hack Lab
2323 Chem. de Saint-Bernard
Space Antipolis Batiment 9
06220 Vallauris - Sophia Antipolis, France
https://www.linkedin.com/feed/update/urn:li:activity:7339203932214181888
In 2024, Nicolas used Qiling to solve the Ph0wn CTF teaser. See how here:
https://github.com/ph0wn/writeups/blob/master/ph0wnmag/issue-02/04-teaser.md