The generated command line uses --work random:prefix=11,0.
Random? Why is that? I stop the table generation and change
runtime parameters several times a day depending on how I need to
use the computer. Could I with this setting risk generating a
sequence more than once?
srand(time(NULL))
here are my initial questions :
- how many A5.1 engines can be running at the same time on a
Streaming Core with compute capability of 1.2 and 1.3 ?
typical configuration is 1 block per MP and 256 threads per block
resulting in 32threads per physical core.
- where to download the result
we don't know much about THC's tables. rumours are rumours, you have to ask
them yourself.
our tech is nice too, so why not have the fun twice ;).
seriously, since THC's attack did not have the proper impact on the industry we
do it again
and hope to generate this influence.
I'm new here too.
There are two version which I found for this model, and memory seems
to be the only difference
one with 1792 MB
Palit Geforce GTX260 Sonic 1792MB HDMI PCI-Express
And one with 896 MB
PALIT 896MB GeF GTX 260 SONIC 216SP PCI-E 2.0 RET
Is memory (on the GPU) a factor for the A5/1
I can try to start 2 processes each with a different devno=X parameter for the
--device option. As i do not have 2 GPUs i cannot test this right now.
The binaries will not function properly (they still contain a known bug relating
to multi-GPU), but the svn version might just work.
Also, write to
19error_info_injectorINS_15program_options14unknown_optionE
std::exception::what: unknown option network
On Thu, Sep 10, 2009 at 6:58 AM, Sascha Krissler sascha.kriss...@web.
de wrote:
Dear list,
a new release fixes many of the things that annoyed you so far plus
it has support for
a stats client + server, so we can all see how
the tables at this point of completion can decrypt 80% of the
conversations.
50%, 80% ... actually there is no definitive point to say we are done it is
more like
the chances of success are continually rising.
i'm not advanced on cryptography . would you tell me why 50% ?
From: *Sascha
.
i'm not advanced on cryptography . would you tell me why 50% ?
From: *Sascha Krissler*sascha.kriss...@web.de
Date: Fri, Sep 11, 2009 at 8:16 PM
Subject: Re: [A51] sucess?
To: a51@lists.reflextor.com
When reach our initial goal of 2^8.5 tables with 2^28.5 unique
chains
each
Dear number cruncher,
there is a windows exe downloadable at the trac. This would be a good time to
reannounce the project in your local community or update pages in which you link
here. Also during network updates, some chains (default 32, each 16bytes) are
sent to the server to make it harder
yes you can switch (back and forth and forth and back and ...).
if there was a difference between the two versions, it would be noted in the
documentation.
Hi again,
is it possible to switch the binary from linux-64-bit to windows-32-bit,
without somehow converting the linux generated
this attack has only one advantage: 100% success rate.
a rough estimate would be 500 fast (Gt200) cuda gpus working
for 12 hours. (given that the copacobana does 2^36 a5/1 rounds
per second). 12 hours is from the paper below, 2^36 is from some
other paper which i could search the link for. 2^36 is
then you can verify the actual generated table as described here:
http://reflextor.com/trac/a51/wiki/RunningTheProgram#Checkingvaluesagainstthereferenceimplementation
bests
On Tue, Sep 29, 2009 at 7:34 PM, Sascha Krissler sascha.kriss...@web.
de wrote:
dividing the number of chains needed
yes. the tables must be sorted before lookups can be done and should be sorted
before they are distributed, because the receiver does not have to do it then.
this leaves the possibility open to distribute incomplete tables at the expense
of
a sorting run at every receiver.
since the table
Great.
I was able to compile it with visual studio and it runs in the CPU emulation
mode,
so when i find the time i will verify the correctness and integrate it into the
program.
Thank you Frank, good job.
Hi, I am new to this list and project. I have for some weeks now been
intrigued by the
It looks as if some folks use the fixed program, but append the
new chains to their old tables.
*Don't do it*. The new chains have different parameters, so a new
file has to be started. This is also true if you did not change the
number in the --advance option, since the LFSR produces completely
Hi,
you should not quote a digest and then not even refer to its content, thats
double fail.
i assume that you have a degenerate version of A5/1 with a total internal size
of 16 bits.
That is bruteforced in less than a second on my old 486.
Maybe it would help if you clarify what exactly you
the torrents listed are currently only the old lo-tech tables that do not
take advantage of the shrinking keystream during the 100 extra clockings.
These tables work fine, although slower and since our new hi-tech tableset
is nearly complete (in only 8 gpu months instead of the original 240), they
goto m...@lists.airprobe.org
I havent purchased a USRP yet as I am not sure what to go for.
I have no input on what is supported best from the community software.
I want to be able to sample the signal range of GSM from 800 to 1900
(2G and 3G) (not interested in Data)
and be able to use it with
Hi
I have downloaded successfully all tables from http://reflextor.com/torrents/
Those are the old tables. You should have downloaded
http://reflextor.com/e100torrents.html
It has been communicated on the list a while ago that you can improve the
efficency of the tables if you
emulate the
The cuda implementation is currently rotting in
algorithm/A51/implementation/cuda/kernel/bitslice.hpp
the file you mentioned is not used anywhere. but it is a bug indeed.
its not the only one in the file.
the cuda code is currently not functional in any file in the repository.
I recently
Hi,
When cracking a burst, for all DP generated (with 12lsb == 0), about
30% of them will find a match on disk.
The probability to find an endpoint on the disk is the same as the probability
to
produce a merger when adding a new chain to the table. This is only true if your
lookup chain starts
But I came across the attribute Attribute[GroupSize(64)] about which
the brooks documentation says, its for newer ATI cards to allow multiple
kernels to share the same memory area.
this attribute signals the compiler to generate compute shader code
instead of pixel shader code. compute shader
On Sun, Nov 14, 2010 at 01:53:42AM +0100, Georg Hofstetter wrote:
Hi Sylvain,
But is it fast enough ?
I had a shot at writing a bitslincing impl for NVidia using opencl for
my laptop card. (9600M GT). But it turned out that a bitslicing 128
bits impl using SSE x86_64 would be
On Sun, Nov 14, 2010 at 02:26:47AM +0100, Georg Hofstetter wrote:
Hello Sascha,
thanks for your explanation.
This means, the my_kernel*s are not directly output from the brooks
compiler, but modified manually? This explains why I couldn't reproduce
the same code :)
no, they
On Sun, Nov 21, 2010 at 08:13:22PM +, bert riske wrote:
I have several problems with compiling airprobe/gsmdecode.
In config.log I noticed the following error:
conftest.c:11:28: error: ac_nonexistent.h: No such file or directory
configure:3974: $? = 1
configure: failed program was:
|
howdy
hardware prices are declining, so the rainbow tables can be bought on
HD for 130EUR + shipping from now on. the 2 TB drive would be shipped
worldwide (15EUR) or EU wide (9 EUR) with 47 2/3 tables on it.
They will probably also be circulating at the 27C3 in Berlin at the end
of December.
On Tue, Dec 14, 2010 at 08:07:45PM +0930, alex au wrote:
Hi Guys,
I'm getting a hdd with the tables and was wondering what a good or basic
laptop set up to start off with. I'll have a nokia 3310 with the data cable.
So what things should i look at for Laptop specs and what type of caddy
On Tue, Dec 14, 2010 at 04:01:35PM +0100, Georg Hofstetter wrote:
Hi.
In case you need a rough reference:
my Dell XPS 420 E8500 Core 2 Duo, 3.16GHz with one WD 1TB HDD
(Caviar Green[?]) using Kraken under Win32.
I assume NCQ is active and working.
using ATI HD3850: 153 seconds per
On Tue, Dec 14, 2010 at 04:22:03PM +0100, Georg Hofstetter wrote:
How many tables are on the disk and how many bursts did you try to decrypt?
Of course its a 2TB HDD, just saw my typo :)
The 153s is the maximum lookup time - when having no match.
Thats the HDD you sent - not sure how
On Wed, Dec 15, 2010 at 04:00:52PM +0100, Alex wrote:
Hello everybody,
I plan to build a quite powerful computer fully compatible with all the
software.
I read all the thread of the mailing list, but I'm a bit lost.
I thought to put :
2 x ATI Radeon HD 5970
2 x 4GB 1333MHz DDR3
1 x
On Fri, Dec 24, 2010 at 09:20:49AM +0100, Peter Stuge wrote:
alex au wrote:
I was actually wondering how fast would the system run with 2 usb
3.0 sata ncq caddies of 1 tb hdd each?
USB 3.0 is rather new technology and I expect that chipsets are still
buggy or plain slow.
That said, the
ftp://81.163.150.57/rainbow-tables/
i was told that this location would be unreachable outside the
27C3 LAN. hope this help a few at least.
Sascha
___
A51 mailing list
A51@lists.reflextor.com
On Tue, Jan 04, 2011 at 12:57:28PM +0200, Omar Atia wrote:
Dears,
Why you are creating rainbow tables ? I have read what is in Airprobe
sniffing ways it is missing how do you decrypt the cipher text with Kc ? do
you have this stage or you are only creating these tables ?
The tables had been
you will not get anything out of the rainbow tables with less than
64bits of keystream, if you abstain from bad ideas like doing 2^N
lookups for each N bits missing.
what is the content of the other half-burst in a typical FACCH usage scenario?
if you can for example come up with significantly
Why I can't get result as in reference post, does anybody have any idea?
It seems like the test case is not in any of the tables that you search
through. Without a kraken installation running i cannot find out whether
this is indeed the case, but with 2 tables you would have to be quite lucky
to
On Fri, Jan 14, 2011 at 05:28:27PM +0200, Tari Mrkis wrote:
Hi,
I haven’t understood a very basic point.
If there is the possibility of backclocking why do we have to build the
rainbow tables to begin with. I understand that if there is a hit in the
It is not possible to clock back
On Tue, Jan 18, 2011 at 07:21:40PM +0200, Tari Mrkis wrote:
Thank you for your answer.It was obvious but I couldn't see it...
I can't see this one too: how do you get from 2^64 keystream space to 2^53
stored data points?From what I understand from the 2^64 states
2^3 states can be excluded due
On Thu, Feb 17, 2011 at 10:35:52PM +0100, Karsten Nohl wrote:
Hi Sylvain,
On 17-Feb-11 21:41, Sylvain Munaut wrote:
What are the current performance of the lookup code running on the GPU
? (even in not yet released version).
In rounds per second ? (one round being going from 64 bits
Open the files for seeding in your favourite bittorrent client.
The torrent files are here:
https://opensource.srlabs.de/projects/a51-decrypt/files
On Tue, Mar 01, 2011 at 07:15:44AM +, Matthew Harper wrote:
I have recently finished copying the A51 tables that I have downloaded
onto a
If you are refering to the A5/1 register backclocking: that is
implemented in the files Bidirectional.[h|cpp] in the kraken
repository.
Additionally there is an illustrative javascript implementation at:
http://reflextor.com/a51demo.html
On Sun, Mar 20, 2011 at 06:32:29PM +0530, Ilango R wrote:
On Mon, Apr 25, 2011 at 10:18:11PM +0200, Sylvain Munaut wrote:
Hi,
Apologies if this subject has already been covered, but has anyone attempted
to do table generations using PS3 hardware?
I did a few back-of-the-enveloppe calculation and it ended up being in
the same order of magnitude
On Thu, Jun 30, 2011 at 10:00:19AM +0800, hunting wrote:
Dear all:
We now have some SSD disks in hand, and want to import the rainbow
tables into such disks in order to crack A5/1 faster.
However, two new problems has arisen：
1. If we use the traditional table
1 2 3 test
___
A51 mailing list
A51@lists.reflextor.com
http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51
43 matches
Mail list logo
