|
|
Up |
|
|
  |
Author: John E. HadstateJohn E. Hadstate
Date: Dec 31, 2006 21:33
> John,
>
> I think this was smashingly on topic and probably the most
> important crypto thing discussed in months.
I'm willing to defer to those who say that sci.crypt should
be confined to topics in cryptography and that discussions
about the peculiarities of Microsoft products are off-topic
here.
I have found an explanation for some of the behavior I
observed (operator error). I suppose we could talk about
whether I should have been able to shoot myself in the foot
quite so easily, but again, that's really OT for this
newsgroup.
|
| |
|
| |
2 Comments |
|
  |
Author: DarkProtomanDarkProtoman
Date: Dec 31, 2006 20:19
DarkProtoman wrote:
> Jean-François Michaud wrote:
>> DarkProtoman wrote:
>>> Jean-François Michaud wrote:
>>>> DarkProtoman wrote:
>>>>> I'm writing an enigma-like cipher w/five rotors where adjacent rotors
>>>>> rotate opposite direction of their neighbors and they have variable
>>>>> stepping in which they step a number of times equal to the position of
>>>>> the character they're on plus one, starting from zero, ie. in FOOD, F's
>>>>> position would be zero, and the rotors would step once, on O they would
>>>>> step twice, etc. Keeping w/ the fact that the first rotor would step
>>>>> after every character, the second rotor would step when the first one
>>>>> stepped 36 times,etc. How much more security would that give me over a
>>>>> normal three rotor machine.
>>>>
>>>> Hello DarkProtoman,
>>>>
>>>> I'm actually working on something similar to you right now. It's funny
>>>> how Enigma like machines are resurfacing :). 5 rotos with 27 characters
>>>> (27 cogs) will give you 14348907 possible states to start from. If an ...
|
| Show full article (5.82Kb) |
|
| |
no comments
|
|
  |
Author: DarkProtomanDarkProtoman
Date: Dec 31, 2006 20:04
Jean-François Michaud wrote:
> DarkProtoman wrote:
>> Jean-François Michaud wrote:
>>> DarkProtoman wrote:
>>>> I'm writing an enigma-like cipher w/five rotors where adjacent rotors
>>>> rotate opposite direction of their neighbors and they have variable
>>>> stepping in which they step a number of times equal to the position of
>>>> the character they're on plus one, starting from zero, ie. in FOOD, F's
>>>> position would be zero, and the rotors would step once, on O they would
>>>> step twice, etc. Keeping w/ the fact that the first rotor would step
>>>> after every character, the second rotor would step when the first one
>>>> stepped 36 times,etc. How much more security would that give me over a
>>>> normal three rotor machine.
>>>
>>> Hello DarkProtoman,
>>>
>>> I'm actually working on something similar to you right now. It's funny
>>> how Enigma like machines are resurfacing :). 5 rotos with 27 characters
>>> (27 cogs) will give you 14348907 possible states to start from. If an
>>> attacker had the algorithm, knowing how the rotors move, he could ...
|
| Show full article (4.91Kb) |
|
2 Comments |
|
  |
Author: John E. HadstateJohn E. Hadstate
Date: Dec 31, 2006 19:31
> "John E. Hadstate" hotmail.com> writes:
>> Yes, one key point here is that I fully tested both
>> Outlook 2000 and
>> Outlook Express more than a year ago and both correctly
>> encrypted
>> with 3DES. I believe the change happened sometime in the
>> last 6 (?)
>> weeks, possibly as a result of upgrading (?) to IE7 or
>> perhaps as a
>> result of one of Microsoft's automatic updates.
>
> Weird, I just noticed this thread and wonder what's up.
>
>> IE7's help window reports its cipher strength as 128-bit.
>> Connecting to a financial services site with https shows
>> another
>> interesting development. If you clicked on the Padlock
>> Icon, IE6 ...
|
| Show full article (1.09Kb) |
|
no comments
|
|
  |
Author: Jean-François MichaudJean-François Michaud
Date: Dec 31, 2006 16:21
DarkProtoman wrote:
> Jean-François Michaud wrote:
>> DarkProtoman wrote:
>>> I'm writing an enigma-like cipher w/five rotors where adjacent rotors
>>> rotate opposite direction of their neighbors and they have variable
>>> stepping in which they step a number of times equal to the position of
>>> the character they're on plus one, starting from zero, ie. in FOOD, F's
>>> position would be zero, and the rotors would step once, on O they would
>>> step twice, etc. Keeping w/ the fact that the first rotor would step
>>> after every character, the second rotor would step when the first one
>>> stepped 36 times,etc. How much more security would that give me over a
>>> normal three rotor machine.
>>
>> Hello DarkProtoman,
>>
>> I'm actually working on something similar to you right now. It's funny
>> how Enigma like machines are resurfacing :). 5 rotos with 27 characters
>> (27 cogs) will give you 14348907 possible states to start from. If an
>> attacker had the algorithm, knowing how the rotors move, he could
>> probably brute force to try and figure out what initial state the ...
|
| Show full article (3.29Kb) |
|
no comments
|
|
  |
Author: Greg RoseGreg Rose
Date: Dec 31, 2006 15:30
>I'm writing an enigma-like cipher w/five rotors where adjacent rotors
>rotate opposite direction of their neighbors and they have variable
I don't think rotating in any particular direction
matters, since it would be exactly equivalent to a
reflected rotor rotating in the same direction.
>stepping in which they step a number of times equal to the position of
>the character they're on plus one, starting from zero, ie. in FOOD, F's
>position would be zero, and the rotors would step once, on O they would
>step twice, etc. Keeping w/ the fact that the first rotor would step
>after every character, the second rotor would step when the first one
>stepped 36 times,etc. How much more security would that give me over a
>normal three rotor machine.
I'm not sure that it gives you any extra security
at all. If the rotors stepped irregularly based on
something the attacker didn't already know, that
might be helpfu. (The US M209(?) did this I
believe.)
|
| Show full article (1.34Kb) |
|
3 Comments |
|
  |
|
|
  |
Author: laura fairheadlaura fairhead
Date: Dec 31, 2006 14:50
On 29 Dec 2006 16:34:39 -0800, tomstdenis@ gmail.com wrote:
>First off, thanks to the peeps in the other thread. Nice to know there
>is some respectful folk around "on the Net." I was getting flack from
>the peanut gallery but it's died down and nothing serious...
|
| Show full article (2.78Kb) |
|
no comments
|
|
  |
Author: Antony ClementsAntony Clements
Date: Dec 31, 2006 14:47
> The goal of CFB mode is privacy. Not "garbling the file when a bit
> error occurs."
i thought privacy was inability to extract the message. if the message, or
parts of the message are garbled, doesn't achieve that? or does privacy have
a different connotation in cryptography?
|
| Show full article (1.10Kb) |
|
1 Comment |
|
  |
|
|
  |
Author: StephenStephen
Date: Dec 31, 2006 14:14
I'm playing with Truecrypt and am not sure how best to choose a good
password. Anyone have any advice on how best to do this? I can use a
random sequence of characters but how do I remember them in the future
without writing them down?
Thanks!
|
| |
|
3 Comments |
|
|
|
|
|
|