anderson windows
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 20
Linux in a window of Windows 4.0-r0
Linux in a window of Windows. Run the Debian Linux appliance in the free VMware Player side by side with Windows. This is a full desktop Gnome install... more>> <<less
Download (455993KB)
Added: 2009-04-13 License: Freeware Price: Free
196 downloads
Windows Powertools 4.0.0.1
Windows Powertools has these features : *Cache2Trash:Clear unwanted temporary files to gain space *DiskCheck: Check for disk errors and resol... more>> <<less
Download (655KB)
Added: 2009-04-07 License: Freeware Price: Free
1074 downloads
Windows tips and tricks 1.0
This is free collection of an authors advices. File format: chm.... more>> <<less
Download (41KB)
Added: 2009-04-02 License: Freeware Price: Free
259 downloads
MassResolve 0.1
MassResolve application performs reverse DNS lookups for network blocks or an input file. more>>
MassResolve application performs reverse DNS lookups for network blocks or an input file. The requests can be performed mulit-threaded.
Usage:
./res < subnet or filename to resolve > < forks >
Code:
/*
MassResolve (C) 2000 John Anderson (john@ev6.net)
This program performs reverse dns lookups for network blocks
or an input file and supports multi threading.
*/
#include < stdio.h>
#include < fcntl.h>
#include < netdb.h>
#include < signal.h>
#include < sys/time.h>
#include < unistd.h>
#include < netinet/in.h>
#include < netinet/ip.h>
#include < netinet/ip_icmp.h>
#include < errno.h>
#include < string.h>
#include < getopt.h>
#include < setjmp.h>
char *
rlookup (u_long ip)
{
static char hostname[256];
struct hostent *host;
struct sockaddr_in addr;
addr.sin_addr.s_addr = ip;
host =
gethostbyaddr ((char *) &addr.sin_addr, sizeof (addr.sin_addr), AF_INET);
if (host == NULL)
{
printf ("%s does not resolve.n", inet_ntoa (ip));
fflush (stdout);
}
else
{
printf ("%s resolves to %sn", inet_ntoa (ip), host->h_name);
fflush (stdout);
}
}
int maxforq = 0;
int
main (int argc, char **argv)
{
int pid, k, j, frk, i, mforks;
char *pt;
char mehost[200], sv[3];
FILE *inp;
mforks = 64; /* default */
if (argv[1] == NULL)
{
printf ("Usage: %s n", argv[0]);
exit (0);
}
if (!argv[2] == NULL)
{
mforks = atoi (argv[2]);
}
/* printf ("Resolving all hosts in %s with %d threadsn", argv[1], mforks); */
if((inp=fopen(argv[1],"r"))!=NULL)
{
while(fgets(mehost,sizeof(mehost),inp))
{
sscanf(mehost,"%sn",mehost);
frk = fork ();
if (frk == 0)
{
fflush (stdout);
rlookup (inet_addr (mehost));
exit (0);
}
else
{ /* frk = 0 */
maxforq++;
if (maxforq > mforks)
{
wait (NULL); // waiting until the child died
maxforq--;
}
}
}
fclose(inp);
exit(0);
}
pt = strchr (argv[1], .);
if (pt == NULL)
{ /* ANET */
for (k = 0; k<<less
Usage:
./res < subnet or filename to resolve > < forks >
Code:
/*
MassResolve (C) 2000 John Anderson (john@ev6.net)
This program performs reverse dns lookups for network blocks
or an input file and supports multi threading.
*/
#include < stdio.h>
#include < fcntl.h>
#include < netdb.h>
#include < signal.h>
#include < sys/time.h>
#include < unistd.h>
#include < netinet/in.h>
#include < netinet/ip.h>
#include < netinet/ip_icmp.h>
#include < errno.h>
#include < string.h>
#include < getopt.h>
#include < setjmp.h>
char *
rlookup (u_long ip)
{
static char hostname[256];
struct hostent *host;
struct sockaddr_in addr;
addr.sin_addr.s_addr = ip;
host =
gethostbyaddr ((char *) &addr.sin_addr, sizeof (addr.sin_addr), AF_INET);
if (host == NULL)
{
printf ("%s does not resolve.n", inet_ntoa (ip));
fflush (stdout);
}
else
{
printf ("%s resolves to %sn", inet_ntoa (ip), host->h_name);
fflush (stdout);
}
}
int maxforq = 0;
int
main (int argc, char **argv)
{
int pid, k, j, frk, i, mforks;
char *pt;
char mehost[200], sv[3];
FILE *inp;
mforks = 64; /* default */
if (argv[1] == NULL)
{
printf ("Usage: %s n", argv[0]);
exit (0);
}
if (!argv[2] == NULL)
{
mforks = atoi (argv[2]);
}
/* printf ("Resolving all hosts in %s with %d threadsn", argv[1], mforks); */
if((inp=fopen(argv[1],"r"))!=NULL)
{
while(fgets(mehost,sizeof(mehost),inp))
{
sscanf(mehost,"%sn",mehost);
frk = fork ();
if (frk == 0)
{
fflush (stdout);
rlookup (inet_addr (mehost));
exit (0);
}
else
{ /* frk = 0 */
maxforq++;
if (maxforq > mforks)
{
wait (NULL); // waiting until the child died
maxforq--;
}
}
}
fclose(inp);
exit(0);
}
pt = strchr (argv[1], .);
if (pt == NULL)
{ /* ANET */
for (k = 0; k<<less
Download (0.004MB)
Added: 2007-08-22 License: GPL (GNU General Public License) Price:
796 downloads
Tartan text parser 0.1.0
Tartan is a text parsing engine targeted at wiki text. more>>
Tartan is a text parsing engine targeted at wiki text. The syntax specification is defined in YAML in the form of regex-based rules.
It supports layering and multiple output types. Rules for Markdown to HTML are included, with optional layered extensions for tables. Tartan text parser is implemented in Ruby, but looking to have implementations in other languages.
<<lessIt supports layering and multiple output types. Rules for Markdown to HTML are included, with optional layered extensions for tables. Tartan text parser is implemented in Ruby, but looking to have implementations in other languages.
Download (0.047MB)
Added: 2006-08-21 License: MIT/X Consortium License Price:
1159 downloads
NewPKI 2.0.0
NewPKI is a PKI based on the OpenSSL low-level API, all the datas are handled through a database. more>>
NewPKI is a PKI based on the OpenSSL low-level API, all the datas are handled through a database. The database provides provides a much more flexible PKI than with OpenSSL, such as seeking a certificate with a search engine.
Enhancements:
- Testing the presence of either PTHREAD_MUTEX_RECURSIVE or either PTHREAD_MUTEX_RECURSIVE_NP in configure script (Xavier Pechoultres).
- Greatly improved the configure script.
- Corrected bug when requesting the certificate to be sent to the end-user on a PKCS#10 request.
- Added the possibilty to warn a certificates owner when the certificate is about to expiry (Erik Anderson).
- Created a File publication module.
- Added the possibility to restore a CA cert from a PKCS#12.
- Added the possibility to view the certificate and CRL extensions from the CA GUI.
- Added a "Object/Code Sign" extensions template (Neil Franken).
- Validating the extension when manually added.
- Changed the Error window, to be able to copy the error message.
- When an email failed to be sent it still was removed from the DB.
- Added the EE Entity (GUI).
- Added the EE Site.
- Sanatized the code for handling the asynchronous messages.
- Added display filters for the profiles on the RA Admin GUI.
- Added "keyEncipherment" to extension "keyUsage" on template "SSL Server" to make certificate work with Firefox/Mozilla (Paul Freeman).
- Fixed a bug on date filter in Logs Filter Window (Paul Freeman).
- Added display filters in RA GUI.
- Changed the inactivity timeout from 5 mins to 1 hour.
- Fixed a memleak when handling CSP Private Keys.
- Added automatic switch of LDAP Protocol when server doesnt support current Protocol version (sCrypto).
- Corrected a problem with the way the memory was allocated in the Publication modules.
- Added the possibility to import a PKCS#12 to a Smart Card from the RA GUI.
- Added missing ACL strings.
- Fixed bug when deleting a DN entry in RA Conf, the display wasnt refreshed (Romain BOTTAN).
- When deleting a DN Entry in RA Conf, removing its associated DN Policy.
- When SMTP servers name fails to be resolved, Entity is still loaded, we retry later to resolve the name (sCrypto).
- Now handling CSRs extensions (Brian Gregory).
- Now handling certificate suspension (Diego de Felice).
- Greatly improved SQL performances by using ReadersWriter access on connection.
- Fixed a nasty Dead-Lock in ReadersWriter.
- Fixed a race condition in Entity_RA.
- Fixed a race condition in Entity_EE.
- Validating the return of most sprintf.
- Compiling FileLog.cpp with __USE_LARGEFILE64, this allows to have a bigger Log file.
- Upgraded autoconf (2.59-5), automake (1.9.5-1), gettext (0.14.3-1) and libtool (1.5.16) compilation scripts.
- RPMs are now compiled on FC4.
- Upgraded to openssl 0.9.7g (WIN32).
- Added a Batch importation feature on the RA.
- Fixed a few 64 bit compilation issues on client (Andreas Jochens).
<<lessEnhancements:
- Testing the presence of either PTHREAD_MUTEX_RECURSIVE or either PTHREAD_MUTEX_RECURSIVE_NP in configure script (Xavier Pechoultres).
- Greatly improved the configure script.
- Corrected bug when requesting the certificate to be sent to the end-user on a PKCS#10 request.
- Added the possibilty to warn a certificates owner when the certificate is about to expiry (Erik Anderson).
- Created a File publication module.
- Added the possibility to restore a CA cert from a PKCS#12.
- Added the possibility to view the certificate and CRL extensions from the CA GUI.
- Added a "Object/Code Sign" extensions template (Neil Franken).
- Validating the extension when manually added.
- Changed the Error window, to be able to copy the error message.
- When an email failed to be sent it still was removed from the DB.
- Added the EE Entity (GUI).
- Added the EE Site.
- Sanatized the code for handling the asynchronous messages.
- Added display filters for the profiles on the RA Admin GUI.
- Added "keyEncipherment" to extension "keyUsage" on template "SSL Server" to make certificate work with Firefox/Mozilla (Paul Freeman).
- Fixed a bug on date filter in Logs Filter Window (Paul Freeman).
- Added display filters in RA GUI.
- Changed the inactivity timeout from 5 mins to 1 hour.
- Fixed a memleak when handling CSP Private Keys.
- Added automatic switch of LDAP Protocol when server doesnt support current Protocol version (sCrypto).
- Corrected a problem with the way the memory was allocated in the Publication modules.
- Added the possibility to import a PKCS#12 to a Smart Card from the RA GUI.
- Added missing ACL strings.
- Fixed bug when deleting a DN entry in RA Conf, the display wasnt refreshed (Romain BOTTAN).
- When deleting a DN Entry in RA Conf, removing its associated DN Policy.
- When SMTP servers name fails to be resolved, Entity is still loaded, we retry later to resolve the name (sCrypto).
- Now handling CSRs extensions (Brian Gregory).
- Now handling certificate suspension (Diego de Felice).
- Greatly improved SQL performances by using ReadersWriter access on connection.
- Fixed a nasty Dead-Lock in ReadersWriter.
- Fixed a race condition in Entity_RA.
- Fixed a race condition in Entity_EE.
- Validating the return of most sprintf.
- Compiling FileLog.cpp with __USE_LARGEFILE64, this allows to have a bigger Log file.
- Upgraded autoconf (2.59-5), automake (1.9.5-1), gettext (0.14.3-1) and libtool (1.5.16) compilation scripts.
- RPMs are now compiled on FC4.
- Upgraded to openssl 0.9.7g (WIN32).
- Added a Batch importation feature on the RA.
- Fixed a few 64 bit compilation issues on client (Andreas Jochens).
Download (0.54MB)
Added: 2006-07-12 License: GPL (GNU General Public License) Price:
1200 downloads
nrsTable 0.3.3
nrsTable is a JavaScript script that will allow a developer to create HTML tables from arrays. more>>
nrsTable library is a JavaScript script that will allow a developer to create HTML tables from arrays.
The tables can be automatically sorted simply by clicking on the heading. A lot of customization can be done for the tables, such as colors, pages, captions, and more.
The following are some examples of how nrsTable can be used to make dynamic tables. Now, I have already entered the script declaration, which looks like:
< script type="JavaScript" src="nrs_table.js" >< /script >
In the head of this page. Now we can create different examples. Note that each table must have its own, unique id in order for this to work.
Ill also be using the same dummy data for all the tables, since I dont feel like writting more than one example.
The dummy data will look like this:
< script language="JavaScript" src="nrsTable.js" >
var header = new Array("First Name", "Last Name", "Income", "Date Hired");
var data = new Array( new Array ( "Joseph", "Smith", "$35,000", "2000"),
new Array ( "Aaron", "Zelzet", "$45,000", "1997"),
new Array ( "Michael", "Doe", "$55,000", "1965"),
new Array ( "Cindy", "Perez", "$44,345", "2004"),
new Array ( "Robert", "Williams", "$48,234", "1990"),
new Array ( "William", "Cohen", "$12,234", "2005"),
new Array ( "David", "Gross", "$34,563", "1998"),
new Array ( "Linda", "Mendez", "$46,975", "1988"),
new Array ( "Karen", "Anderson", "$124,345", "1978"),
new Array ( "Veronica", "OReiley", "$89,034", "1968")
);
< /script >
Enhancements:
- A small bug that would skip displaying a row at the beginning of a table was fixed.
- This was only the case in IE.
<<lessThe tables can be automatically sorted simply by clicking on the heading. A lot of customization can be done for the tables, such as colors, pages, captions, and more.
The following are some examples of how nrsTable can be used to make dynamic tables. Now, I have already entered the script declaration, which looks like:
< script type="JavaScript" src="nrs_table.js" >< /script >
In the head of this page. Now we can create different examples. Note that each table must have its own, unique id in order for this to work.
Ill also be using the same dummy data for all the tables, since I dont feel like writting more than one example.
The dummy data will look like this:
< script language="JavaScript" src="nrsTable.js" >
var header = new Array("First Name", "Last Name", "Income", "Date Hired");
var data = new Array( new Array ( "Joseph", "Smith", "$35,000", "2000"),
new Array ( "Aaron", "Zelzet", "$45,000", "1997"),
new Array ( "Michael", "Doe", "$55,000", "1965"),
new Array ( "Cindy", "Perez", "$44,345", "2004"),
new Array ( "Robert", "Williams", "$48,234", "1990"),
new Array ( "William", "Cohen", "$12,234", "2005"),
new Array ( "David", "Gross", "$34,563", "1998"),
new Array ( "Linda", "Mendez", "$46,975", "1988"),
new Array ( "Karen", "Anderson", "$124,345", "1978"),
new Array ( "Veronica", "OReiley", "$89,034", "1968")
);
< /script >
Enhancements:
- A small bug that would skip displaying a row at the beginning of a table was fixed.
- This was only the case in IE.
Download (0.031MB)
Added: 2006-02-15 License: GPL (GNU General Public License) Price:
1346 downloads
Algorithm::Knapsack 0.02
Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. more>>
Algorithm::Knapsack is a brute-force algorithm for the knapsack problem.
SYNOPSIS
use Algorithm::Knapsack;
my $knapsack = Algorithm::Knapsack->new(
capacity => $capacity,
weights => @weights,
);
$knapsack->compute();
foreach my $solution ($knapsack->solutions()) {
foreach my $index (@{$solution}) {
# do something with $weights[$index]
}
}
The knapsack problem asks, given a set of items of various weights, find a subset or subsets of items such that their total weight is no larger than some given capacity but as large as possible.
This module solves a special case of the 0-1 knapsack problem when the value of each item is equal to its weight. Capacity and weights are restricted to positive integers.
METHODS
new
my $knapsack = Algorithm::Knapsack->new(
capacity => $capacity,
weights => @weights,
);
Creates a new Algorith::Knapsack object. Value of $capacity is a positive integer and @weights is a reference to an array of positive integers, each of which is less than $capacity.
compute
$knapsack->compute();
Iterates over all possible combinations of weights to solve the knapsack problem. Note that the time to solve the problem grows exponentially with respect to the number of items (weights) to choose from.
solutions
my @solutions = $knapsack->solutions();
Returns a list of solutions. Each solution is a reference to an array of indexes to @weights.
<<lessSYNOPSIS
use Algorithm::Knapsack;
my $knapsack = Algorithm::Knapsack->new(
capacity => $capacity,
weights => @weights,
);
$knapsack->compute();
foreach my $solution ($knapsack->solutions()) {
foreach my $index (@{$solution}) {
# do something with $weights[$index]
}
}
The knapsack problem asks, given a set of items of various weights, find a subset or subsets of items such that their total weight is no larger than some given capacity but as large as possible.
This module solves a special case of the 0-1 knapsack problem when the value of each item is equal to its weight. Capacity and weights are restricted to positive integers.
METHODS
new
my $knapsack = Algorithm::Knapsack->new(
capacity => $capacity,
weights => @weights,
);
Creates a new Algorith::Knapsack object. Value of $capacity is a positive integer and @weights is a reference to an array of positive integers, each of which is less than $capacity.
compute
$knapsack->compute();
Iterates over all possible combinations of weights to solve the knapsack problem. Note that the time to solve the problem grows exponentially with respect to the number of items (weights) to choose from.
solutions
my @solutions = $knapsack->solutions();
Returns a list of solutions. Each solution is a reference to an array of indexes to @weights.
Download (0.004MB)
Added: 2007-05-16 License: Perl Artistic License Price:
540 downloads
Mknew 1-2
Mknew project is an investigation of how to build simple Unix shell scripts to manage common development and administrative task more>>
Mknew project is an investigation of how to build simple Unix shell scripts to manage common development and administrative tasks.
The emphasis is on using languages and tools that already exist and are in common use rather than inventing something new. A related emphasis is on exploring the functional programming nature of the bash shell.
This is accomplished by (1) using the bash function capability, and (2) using the bash "$(" ")"syntax to delay function execution in bash scripts. This allows building scripts that have a Lisp like function syntax.
Capturing and factoring the syntax of procedures into bash funtions permits shell scripts to be written as a series of function calls with minimal syntax. A common syntactical pattern in mknew scripts is
verb noun noun noun ...
or, somewhat more precisely,
function argument1 argument2 ...
The goal of mknew is to provide a way to specify make procedures of heterogeneous components in a bash script. These components can include
- diverse source code languages,
- documentation texts,
- test procedures and
- data.
mknew supports the integration of software build procedures with other software development administration procedures, such as unit, integration, and systems testing; distribution; and installation.
In addition to the mknew function library, these "make" procedures rely only on tools provided by the bash shell, and common Unix command line utilities.
Enhancements:
- This release provides new capabilities and further explorations of bash functions.
- This version of mknew supports the deployment of files to arbitrary destinations, and is useful for managing many different types of files, such as configuration files, using a consistent activity pattern.
- Once mknew is installed, an "mkd" file is created in the source file directory, specifying the primary source file types.
- To deploy files, simply type "mk all" at the shell prompt.
<<lessThe emphasis is on using languages and tools that already exist and are in common use rather than inventing something new. A related emphasis is on exploring the functional programming nature of the bash shell.
This is accomplished by (1) using the bash function capability, and (2) using the bash "$(" ")"syntax to delay function execution in bash scripts. This allows building scripts that have a Lisp like function syntax.
Capturing and factoring the syntax of procedures into bash funtions permits shell scripts to be written as a series of function calls with minimal syntax. A common syntactical pattern in mknew scripts is
verb noun noun noun ...
or, somewhat more precisely,
function argument1 argument2 ...
The goal of mknew is to provide a way to specify make procedures of heterogeneous components in a bash script. These components can include
- diverse source code languages,
- documentation texts,
- test procedures and
- data.
mknew supports the integration of software build procedures with other software development administration procedures, such as unit, integration, and systems testing; distribution; and installation.
In addition to the mknew function library, these "make" procedures rely only on tools provided by the bash shell, and common Unix command line utilities.
Enhancements:
- This release provides new capabilities and further explorations of bash functions.
- This version of mknew supports the deployment of files to arbitrary destinations, and is useful for managing many different types of files, such as configuration files, using a consistent activity pattern.
- Once mknew is installed, an "mkd" file is created in the source file directory, specifying the primary source file types.
- To deploy files, simply type "mk all" at the shell prompt.
Download (0.020MB)
Added: 2006-10-13 License: MIT/X Consortium License Price:
1106 downloads
Synscan 3.1
Synscan is a tool to determine the TCP ports that are in an OPEN state. more>>
Another aspect of enumeration of hosts is the determining of TCP ports in an OPEN state, that is to say TCP ports which respond to SYN packets with a Syn and the ACK flag set, Syn-Ack.
Synscan is impressively fast at determinining this via the use of two processes, one to send the Syn packets and one to listen for the responses. NB: At first start with low settings as it can impact systems if it is run too fast. The portparse utility is also a useful little tool!
Should compile cleanly on IRIX, Solaris and Linux if you have
libpcap installed.
Licensed under the GPL version 2. If you modify this app for your own needs, i would appreciate a copy of the changes being emailed to me.
Edit synscan.h to configure a few parameters before compiling.
Synscan works using 2 programs..
The "synscan" tool will send SYN packets.
And a second program, either synscand or sslog will listen for the resulting SYN/ACK packets to determine if ports are open.
Compiling this tool will create 3 binaries:
synscan - for sending SYN packets
synscand - logs replies and performs protocol specific checks
sslog - logs replies and shows ip:port results
<<lessSynscan is impressively fast at determinining this via the use of two processes, one to send the Syn packets and one to listen for the responses. NB: At first start with low settings as it can impact systems if it is run too fast. The portparse utility is also a useful little tool!
Should compile cleanly on IRIX, Solaris and Linux if you have
libpcap installed.
Licensed under the GPL version 2. If you modify this app for your own needs, i would appreciate a copy of the changes being emailed to me.
Edit synscan.h to configure a few parameters before compiling.
Synscan works using 2 programs..
The "synscan" tool will send SYN packets.
And a second program, either synscand or sslog will listen for the resulting SYN/ACK packets to determine if ports are open.
Compiling this tool will create 3 binaries:
synscan - for sending SYN packets
synscand - logs replies and performs protocol specific checks
sslog - logs replies and shows ip:port results
Download (0.033MB)
Added: 2007-04-21 License: GPL (GNU General Public License) Price:
920 downloads
Tyrant 0.334
Tyrant project is a roguelike game. more>>
Tyrant project is a roguelike game.
Tyrant is a game of heroic adventure, where you pit your wits and cunning against a fearsome array of monsters and fiendish puzzle in your attempt to gain fame and fortune.
Tyrant is a Roguelike Game in the tradition of many other great games such as the original Rogue, Nethack, Angband and ADOM.
These games emphasize addictive gameplay and randomly generated universes to create an immersive and imaginative game that looks deceptively simple yet contains a great deal of detail and strategic depth.
Enhancements:
- Fixed nasty portal bug
- Fixed duplicate hero bug
- Potions with spell effects
- Minor engine improvements
- Item protection in bags
<<lessTyrant is a game of heroic adventure, where you pit your wits and cunning against a fearsome array of monsters and fiendish puzzle in your attempt to gain fame and fortune.
Tyrant is a Roguelike Game in the tradition of many other great games such as the original Rogue, Nethack, Angband and ADOM.
These games emphasize addictive gameplay and randomly generated universes to create an immersive and imaginative game that looks deceptively simple yet contains a great deal of detail and strategic depth.
Enhancements:
- Fixed nasty portal bug
- Fixed duplicate hero bug
- Potions with spell effects
- Minor engine improvements
- Item protection in bags
Download (1.9MB)
Added: 2006-11-06 License: GPL (GNU General Public License) Price:
630 downloads
Distributed Network John The Ripper 0.2.5
Distributed Network John The Ripper is a client/server framework that wraps around a slightly modified version of JohnTheRipper. more>>
Distributed Network John The Ripper is a client/server framework that wraps around a slightly modified version of John The Ripper.
In contrast to the MPI version of John, dnetj allows the use of nodes which are of differing speeds and for nodes which do not run 24/7.
This tool was written for a number of reasons, firstly the MPI version requires an MPI installation on each node, and for the nodes to be configured together and be roughly the same speed. Also, although other distributed password crackers exist (such as djohn or medussa) they all have their own limitations.
The server loads a set of password hashes, and splits the available keyspace into "work units" of a configurable size. The clients connect and retrieve the hashes, as well as a set of work units to process. Once a client has processed some work units, it connects back to the server to submit the completed units as well as any passwords which have been cracked.
Possible uses include eg, running as a background task on all the workstations in an office.
Note, this tool is at an early stage of development and is likely to be very buggy, although it is functional. Bug reports and/or patches are strongly encouraged.
Main features:
- Distributed client/server model, any number of clients can be supported and can be brought up and down at will
- Support for any cipher supported by John 1.7.2 (additional cipher patches should be able to be applied normally)
- Keep the changes to John to a minimum, so that patches/updates can still be applied without too much fuss
- Uses the same optimized encryption routines as John
- Cracked hashes are stored in the standard john.pot format, so they can be displayed with john -show
- Passwd files sent to clients are sanitised (only the hash is sent, other fields from the passwd file are removed)
- Capability for auto client registration
- Code is intentionally kept clean to aid porting
Supported Platforms
Dnetj has been tested on the following systems:
- Linux/x86
- Linux/amd64
- Linux/sparc
- MacOSX/PPC
- MacOSX/Intel
- Solaris/x86
Version restrictions:
- Clients will sometimes crash if unable to connect to the server for a long period of time.
- Work unit size is limited to a 32bit integer number of crypts (ie: 4294967296)
- Node performance calculations wrap once the node has performed more than 4294967296 crypts, so nodes may appear to be much slower than they truly are.
- Doesnt work with NTLM, as the NTLM hash is stored in a different field of the passwd file.
- Traffic is sent in plain text (this makes debugging easier at this early stage of development)
- Makefile is very basic, and has no configure script, compilation on Solaris requires adding -lnsl -lsocket to the compile command.
Enhancements:
- Basic functionality is implemented, and dnetj is usable, but there are many things still to be implemented and a lot more testing is needed.
<<lessIn contrast to the MPI version of John, dnetj allows the use of nodes which are of differing speeds and for nodes which do not run 24/7.
This tool was written for a number of reasons, firstly the MPI version requires an MPI installation on each node, and for the nodes to be configured together and be roughly the same speed. Also, although other distributed password crackers exist (such as djohn or medussa) they all have their own limitations.
The server loads a set of password hashes, and splits the available keyspace into "work units" of a configurable size. The clients connect and retrieve the hashes, as well as a set of work units to process. Once a client has processed some work units, it connects back to the server to submit the completed units as well as any passwords which have been cracked.
Possible uses include eg, running as a background task on all the workstations in an office.
Note, this tool is at an early stage of development and is likely to be very buggy, although it is functional. Bug reports and/or patches are strongly encouraged.
Main features:
- Distributed client/server model, any number of clients can be supported and can be brought up and down at will
- Support for any cipher supported by John 1.7.2 (additional cipher patches should be able to be applied normally)
- Keep the changes to John to a minimum, so that patches/updates can still be applied without too much fuss
- Uses the same optimized encryption routines as John
- Cracked hashes are stored in the standard john.pot format, so they can be displayed with john -show
- Passwd files sent to clients are sanitised (only the hash is sent, other fields from the passwd file are removed)
- Capability for auto client registration
- Code is intentionally kept clean to aid porting
Supported Platforms
Dnetj has been tested on the following systems:
- Linux/x86
- Linux/amd64
- Linux/sparc
- MacOSX/PPC
- MacOSX/Intel
- Solaris/x86
Version restrictions:
- Clients will sometimes crash if unable to connect to the server for a long period of time.
- Work unit size is limited to a 32bit integer number of crypts (ie: 4294967296)
- Node performance calculations wrap once the node has performed more than 4294967296 crypts, so nodes may appear to be much slower than they truly are.
- Doesnt work with NTLM, as the NTLM hash is stored in a different field of the passwd file.
- Traffic is sent in plain text (this makes debugging easier at this early stage of development)
- Makefile is very basic, and has no configure script, compilation on Solaris requires adding -lnsl -lsocket to the compile command.
Enhancements:
- Basic functionality is implemented, and dnetj is usable, but there are many things still to be implemented and a lot more testing is needed.
Download (0.81MB)
Added: 2007-08-17 License: GPL v3 Price:
802 downloads
Morseall 0.4.8
Morseall allows you to control any computer using morse code. more>>
Morseall allows you to control any computer using only the mouse buttons. It allows you to produce keystrokes by tapping Morse codes with just a single button or with a three-button mouse for faster entry.
Morseall is designed for disabled users who can only move one muscle.
Morseall can also be used with wearable laptops, tablets, or handhelds where a keyboard would be inconvenient or unavailable.
Main features:
- Anyone who can press a switch can use Morseall!
- You can go faster if you can control two or three buttons
- An Iambic Keyer is available for ultra-fast coding
- Audio feedback is given for each dot and dash
- Characters can be read aloud as they are typed for verification
- It works with a standard mouse! No custom hardware needed.
- On-line help is always visible for looking up codes
- Takes over the mouse so disabled users can maintain control.
- Code Timing is adjustable from within the program (seven dots=faster)
- A Configuration file allows you to set defaults (/etc/morseall.conf)
- A Reset feature helps users recover if the terminal gets stuck
- Visual feedback on your morse code timing as you key it
- Morseall is Free Software, Licensed under the GNU GPL
Enhancements:
- The most-recent code sequence is kept visible, for better sanity checking.
- A repeat code is available for users who cant hold it in for the normal repeat (some sip/puff users need this)
<<lessMorseall is designed for disabled users who can only move one muscle.
Morseall can also be used with wearable laptops, tablets, or handhelds where a keyboard would be inconvenient or unavailable.
Main features:
- Anyone who can press a switch can use Morseall!
- You can go faster if you can control two or three buttons
- An Iambic Keyer is available for ultra-fast coding
- Audio feedback is given for each dot and dash
- Characters can be read aloud as they are typed for verification
- It works with a standard mouse! No custom hardware needed.
- On-line help is always visible for looking up codes
- Takes over the mouse so disabled users can maintain control.
- Code Timing is adjustable from within the program (seven dots=faster)
- A Configuration file allows you to set defaults (/etc/morseall.conf)
- A Reset feature helps users recover if the terminal gets stuck
- Visual feedback on your morse code timing as you key it
- Morseall is Free Software, Licensed under the GNU GPL
Enhancements:
- The most-recent code sequence is kept visible, for better sanity checking.
- A repeat code is available for users who cant hold it in for the normal repeat (some sip/puff users need this)
Download (0.49MB)
Added: 2006-08-30 License: GPL (GNU General Public License) Price:
1151 downloads
j2bin 1.1
j2Bin is a software that helps Java developers distribute their Java programs (.jars) as Linux executables. more>>
j2Bin is a software that helps Java developers distribute their Java programs (.jars) as Linux executables, making the programs easy to run and use for the end user.
Note: This is the very first release, even so we invite everyone to try it and send feedback.
Enhancements:
- added english translation
- added portuguese-portugal translation
<<lessNote: This is the very first release, even so we invite everyone to try it and send feedback.
Enhancements:
- added english translation
- added portuguese-portugal translation
Download (0.086MB)
Added: 2005-11-22 License: GPL (GNU General Public License) Price:
1432 downloads
John The Ripper MPI 1.7.2-bp17-mpi6
John The Ripper MPI is an updated version of Ryan Lims patch for john the ripper to support MPI more>>
John The Ripper MPI is an updated version of Ryan Lims patch for john the ripper to support MPI, in addition to a large number of third party patches to support additional ciphers and such.
MPI allows you to use multiple processors on a single system, or a cluster of systems for cracking passwords using john the ripper. Incredibly usefull in these days of multi core processors.
A compatible MPI implementation is required.
Benchmarks
Dual Core Intel Core2 Duo, 2.16GHz, MacBook Pro MacOSX
John MPI - Version 1.7.2-bp17-mpi4, 2 threads
Benchmarking: Traditional DES [128/128 BS SSE2]... DONE
Many salts: 3433087.00 c/s real, 3636739.00 c/s virtual
Only one salt: 2852658.00 c/s real, 3021898.00 c/s virtual
Dual AMD Opteron 250 (2.2ghz), Gentoo Linux 64bit
John MPI - Version 1.7.2-bp17-mpi, 2 threads
Benchmarking: Traditional DES [128/128 BS SSE2-16]... DONE
Many salts: 2132632.00 c/s real, 2139034.00 c/s virtual
Only one salt: 1951692.00 c/s real, 1957552.00 c/s virtual
Version restrictions:
- If you use Gentoo, make sure you compile mpich2 _WITHOUT_ the "threads" use flag, otherwise john-mpi will fail to compile with undefined references to MPIU_Free and MPIU_Malloc
- If you use OpenMPI instead of mpich2, the SIGHUP signal doesnt get passed to john. It is necessary to send a SIGUSR1 instead.
Enhancements:
- Support for SIGUSR1 as well as SIGHUP, required for use with OpenMPI
<<lessMPI allows you to use multiple processors on a single system, or a cluster of systems for cracking passwords using john the ripper. Incredibly usefull in these days of multi core processors.
A compatible MPI implementation is required.
Benchmarks
Dual Core Intel Core2 Duo, 2.16GHz, MacBook Pro MacOSX
John MPI - Version 1.7.2-bp17-mpi4, 2 threads
Benchmarking: Traditional DES [128/128 BS SSE2]... DONE
Many salts: 3433087.00 c/s real, 3636739.00 c/s virtual
Only one salt: 2852658.00 c/s real, 3021898.00 c/s virtual
Dual AMD Opteron 250 (2.2ghz), Gentoo Linux 64bit
John MPI - Version 1.7.2-bp17-mpi, 2 threads
Benchmarking: Traditional DES [128/128 BS SSE2-16]... DONE
Many salts: 2132632.00 c/s real, 2139034.00 c/s virtual
Only one salt: 1951692.00 c/s real, 1957552.00 c/s virtual
Version restrictions:
- If you use Gentoo, make sure you compile mpich2 _WITHOUT_ the "threads" use flag, otherwise john-mpi will fail to compile with undefined references to MPIU_Free and MPIU_Malloc
- If you use OpenMPI instead of mpich2, the SIGHUP signal doesnt get passed to john. It is necessary to send a SIGUSR1 instead.
Enhancements:
- Support for SIGUSR1 as well as SIGHUP, required for use with OpenMPI
Download (0.83MB)
Added: 2007-08-18 License: GPL (GNU General Public License) Price:
575 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 2
- 1
- 2
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above anderson windows search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
