Princeton security researchers purport successful attacks against
Microsoft Bitlocker, TrueCrypt, and other mainline disk encryption
products.

There is a video at the following URL that shows an actual attack, and
it looks to be trivial:

http://news.cnet.com/8301-1009_3-10003167-83.html

If you have a laptop and use one of these type encryption solutions,
you probably need to eyeball this one.

Maybe some closer scrutiny will show a method to prevent the attack.

Is secure to use RIPEMD-160 hash function? I know that there are not
known atacks about that algorithm, but I don't know if today is really
secure to use a hash of 160 bits.

Or if would be best to use a hash of 256 bits as minimum (as SHA-256)?
--althought has been created by N S A--

http://vault.telin.com/?dir=./public/Hash

sha256.exe

I'm going to use 95 UTF-8 characters (that occupies 2 bytes each one),
and I want to calculate its entropy for 80 bits --I think that is the
minimum recommend by NIST--.

------------------------
95 latin-1 chars. = 190 bytes

80 / lg(190 by) = 10 by (= 5 UTF-8 chars.)

I have a 32Bit function which calculates some kind of hash using three
secret 32 bit values. The question is how to reverse this or is it
possible to reverse (as i don´t know if this function is based on
something cryptographic algo)?

In my example I defined three SECRET values and generated 60000
plain/crypt pairs as a test system.
Bruteforce attack tooks very long time so how can i reverse such an
algorithm to get SECRET values from generated plain/crypt examples?

here´s a c-example of the algorithm:

unsigned long keycalc(unsigned long myseed)
{
unsigned long sc1,sc2,sc3;
unsigned long hlp;
unsigned short i,j;

sc1 = SECRETVALUE1;
sc2 = SECRETVALUE2;
sc3 = SECRETVALUE3;

I hate M$ for screwing me up..their Encrypted file system is a load of
cr@p.
Ok before ranting more, here's my problem:

In my scenario, there are three WinXP computers: A (desktop), B
(laptop) and C (laptop), all with NTFS
and two external hard drives, EXT1 and EXT2 both with NTFS.
Here's what happened:

1) A had some file F encrypted under NTFS, which I moved to EXT1.
Now I could read F on EXT1 without any problems when accessing it from
A

However, when I tried reading F on EXT1 when accessing from B, I got
the usual error.
So I copied the private key files to EXT1 (as described in M$ site for
recovery agent), imported the private key (PA) of A to B and then
tried reading F on EXT1 via B. It all worked fine.
So far so good.

2) Now somehow my computer A got damaged/lost. Luckily I had backed up
the private key PA to EXT1.
I could now read F via B (as I had already imported PA to B).

Here is a parity shuffle and it takes the initial state and causes all
binary.

The (2) in the code is resolvable in runtime as a parity. Just
ignaore or remove the unused variables.

I just might crack bit-stream type of data sets.

#include

main(){

unsigned int in;
unsigned int out;
unsigned int y;
unsigned int x;
unsigned int end;

in=0x0001;
y=2;
end=0;

while(end<65535){

in=in*(2)*65535; //the (2) is critical to the function.

in = in^end;

printf("out=0x%%04x\n",in);

This is an 'opinion' post.
It is my view, that those who make public vulnerabilities in
wide spread internet software should be locked up.
And it is my opinion, with all respect for life, that those
NUT CASES who use that knowledge and tools to start attacks on websites
BE EXECUTED.

The internet used to be OK, it used to be OK to run your own server.
Now not a day goes by without some kids using toolkits and info obtained
from EGO TRIPPERS like Karspersky (or however you spell the name of that moron)
to try DNS attacks, and other attacks, with the potential to bring down the whole
internet.

Karpersky are you doing it for you own glory? Think about what happens if only
1 in a million internet users 'have a go'.
Idiot!

All right. I was hoping that someone could help me crack a couple of
zip files with probably 50 or more known plain text bytes that are
identical at the beginning of each of these files. But I got no reply
from my original post.

So here is a paper to the point. I am hoping that one or more of you
would like to flex their crypto muscles and help me or to a lesser
extent discuss this topic for our upliftment.

http://www.woodmann.com/fravia/mike_zipattacks.htm

Thanks.

JM

Hello

Don't know if this is the right place to ask, but can anyone tell me
what values would be optimal as a 256 byte state array for the bsd
setstate, random function?

/Dacobi