sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
August 2008
motuwethfrsasuw
    123 31
45678910 32
11121314151617 33
18192021222324 34
25262728293031 35
2008
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

 Up
  Re: Need peer review: May have found mistake in Adler-32!         


Author: Jeffrey Walton
Date: Aug 31, 2008 15:28

> A quick look at the wikipedia article shows an error, in that the
> author claims that "a" can be 0x1013a or 65850 after...
Dr. Adler beat me to the punch: don't trust Wiki. I found too many
mistakes in the past.

Jeff

On Aug 25, 10:22 am, Mark Adler alumni.caltech.edu> wrote:
> Daryle,
>
> There is no mistake in the zlib implementation of Adler-32.  A quick
> look at the wikipedia article shows an error, in...
Show full article (1.06Kb)
2 Comments
  Re: New unbreakable encryption method         


Author: Jack
Date: Aug 31, 2008 13:22

On Aug 26, 8:00 am, Kristian GjXsteen
wrote:
> bosworths.net> wrote:
>>Hi! I developed an unbreakableencryptionmethod that will replace the
>>One Time Pad. I know that sounds unlikely, as so many people have
>>attempted this and failed.
>
> There's a reason people have failed, and it's a theorem by Shannon.
>
> A cipher is said to be "unbreakable" (Shannon said "perfect", we now say
> "information-theoretically secure") if the attacker's knowledge of the
> plaintext is unchanged after seeing the ciphertext.
>
> Shannon proved that for a cipher to be information-theoretically secure,
> the key space must be at least as big as the message space.
>
> The basic idea is that if you have one ciphertext and your system
> has n possible keys, the ciphertext can decrypt to at most n distinct
> messages. If the message space contains more than n messages, there will
> be messages that cannot be decryptions of the ciphertext. ...
Show full article (5.62Kb)
12 Comments
  Obamamania! Thank you but NObama!         


Author: lassie
Date: Aug 30, 2008 10:27

Better photos of Obama and crew here, also his brother in Afrika on $1 per
month;

http://peacemoonbeam.typepad.com/scooters_report/

"Let's elect a lying appeasing elitist racist crackhead Marksis for a
change"
no comments
  Re: What is the next Prime that is 3 mod 4 from this one?         


Author: amzoti
Date: Aug 29, 2008 13:28

On Aug 28, 3:38 pm, Mensanator aol.com> wrote:
> On Aug 28, 4:58 pm, amzoti gmail.com> wrote:
>
>
>
>> Hi,
>
>> I have this prime (base 10):
>
>> 104438888141315250667960271984652954583126906099213500902258875644433817202­232\
>> 269071044404666980978393011158573789036269186012707927049545451721867301692­842\
>> 745914600186688577976298222932119236830334623520436805101030915567415569746­034\
>> 717694639407653515728499489528482163370092181171673897245183497945589701030­633\
>> 346859075135836513878225037226911796898519432244453568741552200715163863814­145\
>> 617842062127782267499502799027867345862954439173691976629900551150544617766­815\
>> 444623488266596168079657690319911608934763494718777890652800800475669257166­692\
>> 296412256617458277670733245237100127216377684122931832490312574071357414100­512\
>> 456196591388889975346173534797001169325631675166067895083002751025580484610­558\
>> 346505544661509044430958305077580850929704003968005743534225392656624089819­586\
>> 363158888893636412992005930845566945403401039147823878418988859467233624276­379\ ...
Show full article (5.37Kb)
45 Comments
  A question on an article dealing with pass phrase and keys         


Author: hayes.gr
Date: Aug 29, 2008 10:44

I was reading the page below.
http://www.interhack.net/people/cmcurtin/snake-oil-faq.html
In the section Keys vs. Passphrases He mentions using a hashing
routine to change a pass phrase in to a key.

I have an issue with this. The hashing system is going to convert the
same input always into the same out put.
So is that not just adding another step to the encryption routine.

So big deal now someone using brute force still tries alpha numeric
first and it goes through the hash function first.
So it really didn't change the fact of what he was arguing about. You
are still only got a limited key size because the hash is still based
on the limits of the pass phrase.

The idea is your methods or code is known to your attacker you would
have to assume he also knows the method of hashing your key.

Or am I missing something?
85 Comments
  A question on block ciphers         


Author: hayes.gr
Date: Aug 29, 2008 08:33

Read applied cryptography and lot of other stuff on the web. From what
I gather most block ciphers operate on a block of material then move
over the length of that block and operate on the next block of
material.

I was trying to find if anyone had done something as I have done in
the past. Guessing they have just haven't found it.
Not needing it analyzed at least not at present I have improvements I
still need to add.

1. I started with a general substitution method on a byte per byte
bases based on password bytes aligning to the data.
Sure that has been done countless times.

2. I then did a bit swap routine inside each byte. Again based on
password byte.

3. Then I stepped to a 32 bit block and did byte swaps based on the
password. Instead of stepping over a full 32 bits again and doing the
same I only step one byte. What this does is shuffles the data to an
extent that some data that was initially in the front of the message
can be scrambled through out.

4. Then the entire data is bit shifted. Again based on password.
Show full article (1.45Kb)
1 Comment
  Re: averaging argument         


Author:
Date: Aug 29, 2008 00:46

Li Weng hong.com> wrote:
>I was wondering what is actually the averaging argument that is used in
>some proofs. I found the following document but I have a hard time to
>understand the notation:
>http://www.cs.princeton.edu/courses/archive/spr06/cos522/averaging.pdf

I'm not familiar with this document, so I'm of course guessing at what
the notation means.
>What is actually the E_y[p_y]? Is it the average of the probabilities?
>Is it equal to:
>\sum_t t * Pr[p_y=t]

No, it is the expected value of p_y when y is sampled from Y, that is:

sum_y p_y * Pr[ Y = y ]
>If so, why is this equal to Pr_{x,y}[C(x,y)=f(x,y)]

Pr_{x,y}[ C(x,y) = f(x) ] = sum_y Pr_{x}[ C(x,y) = f(x) ] * Pr[ Y = y ]

= E_y[ p_y ]

--
Kristian Gj
no comments
  ADVERT: Secure communications         


Author: Robin Carey
Date: Aug 28, 2008 23:48

C12-GAMMA; a free/open-source E-mail security and file encryption
tool for BSD/Linux:

http://www.leopard.uk.com/cion

[ probably the most important cryptography software ever written;
because it contains the CipherPacket source-code/algorithm ]
4 Comments
  Re: New algorithm         


Author: Scott Contini
Date: Aug 28, 2008 23:41

On Aug 29, 9:04 am, peteyj1...@gmail.com wrote:
> Is this a good place to ask how to become a member of "The Club"?

A few questions for you:
1. What ciphers have you broken?
2. What publications do you have in cryptography?

Most people who want a cipher analysed don't have answers to those
questions and do not understand how ciphers are attacked. People
here are not interested in doing the "homework" of other people who
do not know how to analyse their own ciphers. If you want to become
a member of The Club, then you have to first show that you're not
wasting the time of other people here.

Scott
4 Comments
  Re: New algorithm         


Author: WTShaw
Date: Aug 28, 2008 23:19

On Aug 28, 7:49 pm, Paul Rubin <http://phr...@NOSPAM.invalid> wrote:
> peteyj1...@gmail.com writes:
>> Is this a good place to ask how to become a member of "The Club"?

You also must drink the Koolade, wear the dispensed prerequsite
blinders, and learn to march in single file. OK, nothing wrong about
learning to attack any ciphers but to disregard classical stuff is not
good.

The reason that any ciphers can be studied is overcoming old
prejudices against it; it's a shame to repeat that mistake.
Neoclassical ciphers are those that might require computer assistance
at least for convenience but can still be quite useful and pardon the
candy, fun since there is a wealth of unexplored territory out there.
In any study, learning primitives as you find them is essential. New
ciphers are made from using different orders of and combinations of
them...enjoy and beware of trolls that might seek to kill your
independent curiosity for their own ends.
no comments
1 2 3 4 5 6 7