My new friends
Finny and Fatty gallery
Finny and Fatty gallery

These months I have been kept busy with the development, testing and debugging of the new version of Involutive’s browsergame: WarWide.
Note: It is available only for Italian people, but in a few months and English version will come to the light!
WarWide is a free strategic war multiplayer browsergame set in the real world with thousands opposing players, each of them fighting as the emperor of a group of (truly existing) cities and having, as primary goal, the growth of his Empire conquering enemy lands and establishing alliances with governors of nearby territories.

Lots of buildings, technologies and military units are available to give lots of variants and huge longevity to the game.
Each feature of the game is built to be more faithful to realty as possible.
From previous version lots of chances have been done:
Technical details:
Enjoy it!
P.S: I would thank the whole italian WarWide community for their good job in debugging and hinting.
This is a summarizing post of large integers factorization methods I have exposed in my articles.
ksb26 ( Kernel Socks Bouncer ) is a Linux Kernel 2.6.x Loadable Kernel Module that hijacks tcp connections (to user-defined target hosts) through socks 5 servers chains.
ksb26 works as an hidden layer that adds anonymity to software that doesn’t support anonymous connections.
ksb26 is divided into a lkm ( Linux Loadable Kernel Module ) and a userspace manager which communicate via a character device.
- ksb26 lkm intercepts and redirects tcp connections.
- ksb26manager keeps updated socks and target-hosts lists.
Version: 0.0.4
Website: http://ksb.sourceforge.net
Learn more about hijacking system calls in Linux 2.6 kernel.
Note: remember that this is only an idea and I’m not responsible of its use.
Yesterday I was talking with my friend Davide about the announce of Yahoo’s and Google’s CAPTCHAs cracked and another funny and foolish idea, something similar to Javascript online massive social password cracking, came into my mind.
Articles report that breaking algorithms have a success rate from 10% to 35%,with an average of 1 crack for 5 attempts… too slow!
There should be a method to improve the success rate and here I would like to discuss a nice scenario that I hope nobody would implement ;-)
Base idea:
There are three base components to get this idea working:
The success of this approach depends on the topic of the website… We need something that could never become boring… Yes, I know you’re thinking about it! Yeah! Sex!!
So let be pornography the topic of the website.
As explained in the diagram, spam-bots send CAPTCHA decoding requests to cpqueue (part of capster) which forwards them to the website and here unaware users resolve them.
Every 5-6 photos or 2 videos the unaware user have to enter the code of a CAPTCHA displayed on a page to continue browsing. An horde of sizzling surfers will be happy to decode CAPTCHAs to quickly proceed to the next step of strip tease :-D
Probably the wish to see something more will obfuscate the consciousness of what they’re doing!
With a bit of luck we can obtain a success rate of 100% ;-)
I heard that there’s some Virus which implement a similar approach using popup strip teases, but malware has always to fight to survive on a computer so there’s the constant risk that the cracking farm will decline day by day and then.. arent’ we in the Web(2/3/4).0 era or not ?
Thanks to:
Davide Scola that gave me some hints
Motocarota that gives a better look to my thoughts
[This article appeared on OndaQuadra0A Elettronic Magazine]
Fondamenti di Matematica - Algoritmi Fondamentali
Metodo delle curve ellittiche per la fattorizzazione
di numeri interi.
by Paolo Ardoino AKA binduck < paolo.ardoino@gmail.com >
< http://ardoino.com >Prima di passare al prossimo algoritmo per la riduzione in fattori
primi di un numero, conviene spiegare alcuni concetti matematici
e alcuni algoritmi che stanno alla base delle operazioni tra numeri
interi composti da molte cifre.
N.B. Questi sono solo riassunti basilari e molto semplici, che potete
consultare per avere un idea delle nozioni che sono richieste negli
articoli matematico-informatici. Per una completa visione di questi
leggete testi di matematica e algoritmi.
Mi raccomando ricordate che la matematica e’ molto importante se
volete tuffarvi nel campo della crittografia.
Le implementazioni degli algoritmi presentati in questo articolo
possono essere facilmente trovate in ogni libreria matematica per
qualsiasi linguaggio di programmazione.0] Notazione usata
1] Concetti fondamentali
1.1] Matematica
1.1.1] Strutture algebriche
1.1.2] Gruppo
1.1.3] Anello
1.1.4] Campo
1.1.5] Aritmetica modulare
1.1.6] Piccolo teorema di Fermat1.2] Informatica
1.2.1] Calcolabilita’ e complessita’ di un algoritmo
1.2.2] Rappresentazione numerica di un messaggio
1.2.3] Rappresentazione di un messaggio in Zn2] Algoritmi fondamentali
2.1] Test di primalita’ e teorema di Fermat
2.1.1] Probabilistic primality test
2.2] Numeri random
2.2.1] Linear congruential method
2.3] Massimo comun divisore GCD3] Elliptic Curve Method
Read more »