| |
 |
|
|
Science Forum Index » Cryptography Forum » a encrypted haiku...
Page 1 of 1
|
| Author |
Message |
| iceprince... |
Posted: Thu Jul 03, 2008 4:01 am |
|
|
|
Guest
|
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:
http://cryptocellar.org/
A list of his publications:
http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
Quote: -----Original Message-----
From: ******************************
Sent: Wednesday, 02 July, 2008 14:05
To: H.Hveem
Cc: Frode Weierud
Subject: Re: your "enigma type" machine
Dear H. Hveem,
Your friend Frode makes some very clever and to-the-point
remarks about my encrypted haiku! All that I am willing to
reveal is: the system is "progressive polyalphabetic" and the
language can of course be any!
There are no tricks involved. A very short message may at
first appear monoalphabetic indeed. Yours is the first
serious attempt at de-cryption that I hear of, to my delight.
Thank you, good luck & best regards,
Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ? |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Thu Jul 03, 2008 5:10 am |
|
|
|
Guest
|
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
Quote: http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma. |
|
|
| Back to top |
|
| iceprince... |
Posted: Thu Jul 03, 2008 5:45 pm |
|
|
|
Guest
|
Douglas Eagleson wrote:
Quote: On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
-----Original Message-----
From: ******************************
Sent: Wednesday, 02 July, 2008 14:05
To: H.Hveem
Cc: Frode Weierud
Subject: Re: your "enigma type" machine
Dear H. Hveem,
Your friend Frode makes some very clever and to-the-point
remarks about my encrypted haiku! All that I am willing to
reveal is: the system is "progressive polyalphabetic" and the
language can of course be any!
There are no tricks involved. A very short message may at
first appear monoalphabetic indeed. Yours is the first
serious attempt at de-cryption that I hear of, to my delight.
Thank you, good luck & best regards,
Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma.
So that is the answer on that riddle ?
How did you break it ? |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Sat Jul 05, 2008 1:49 am |
|
|
|
Guest
|
On Jul 3, 3:45 pm, iceprince <ispr... at (no spam) home.no> wrote:
Quote: Douglas Eagleson wrote:
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma.
So that is the answer on that riddle ?
How did you break it ?- Hide quoted text -
- Show quoted text -
I emailed the website owner and found out the answer was wrong.
I tried. |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Sat Jul 05, 2008 3:02 am |
|
|
|
Guest
|
On Jul 5, 4:49 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
Quote: On Jul 3, 3:45 pm, iceprince <ispr... at (no spam) home.no> wrote:
Douglas Eagleson wrote:
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma.
So that is the answer on that riddle ?
How did you break it ?- Hide quoted text -
- Show quoted text -
I emailed the website owner and found out the answer was wrong.
I tried.- Hide quoted text -
- Show quoted text -
I tried and the answer to the Haiku was only an allusion to the
content.
Five lists of fourty characters.
Because the shifted carryover was a constant a crack method is
available. It appear to have a four character shift lever, maybe. So
as a wheel rotates one complete revolution a four space shift of the
next wheel occurs.
Like I said enigma had a variable carryover shift and the constant on
this machine allos five lists to attack.
Here is a shift crack list code.
list1(40);
list2(40);
list3(40);
list4(40);
list5(40);
for(i=0;i<(5*2^40);i++){
answer= "norweigen "the");
list1(i);
pop stack list2(i+40); //pop 50 times
pop list3(40+n); // n=4 as a guess
pop list4((40+n)*40);
pop list5((40+n)*2*40);
//and the trick is to NOT do any thing but try this pop without any
key
//after the pop put the register on the bottom of the list!
test all three sttarting letters for the phrase "the"
if successfull i 1
} |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Sat Jul 05, 2008 3:03 am |
|
|
|
Guest
|
On Jul 5, 6:02 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
Quote: On Jul 5, 4:49 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
On Jul 3, 3:45 pm, iceprince <ispr... at (no spam) home.no> wrote:
Douglas Eagleson wrote:
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma.
So that is the answer on that riddle ?
How did you break it ?- Hide quoted text -
- Show quoted text -
I emailed the website owner and found out the answer was wrong.
I tried.- Hide quoted text -
- Show quoted text -
I tried and the answer to the Haiku was only an allusion to the
content.
Five lists of fourty characters.
Because the shifted carryover was a constant a crack method is
available. It appear to have a four character shift lever, maybe. So
as a wheel rotates one complete revolution a four space shift of the
next wheel occurs.
Like I said enigma had a variable carryover shift and the constant on
this machine allos five lists to attack.
Here is a shift crack list code.
list1(40);
list2(40);
list3(40);
list4(40);
list5(40);
for(i=0;i<(5*2^40);i++){
answer= "norweigen "the");
list1(i);
pop stack list2(i+40); //pop 50 times
pop list3(40+n); // n=4 as a guess
pop list4((40+n)*40);
pop list5((40+n)*2*40);
//and the trick is to NOT do any thing but try this pop without any
key
//after the pop put the register on the bottom of the list!
test all three sttarting letters for the phrase "the"
if successfull i 1
}- Hide quoted text -
- Show quoted text -- Hide quoted text -
- Show quoted text -
i forgot list one is poped also! |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Sat Jul 05, 2008 3:06 am |
|
|
|
Guest
|
On Jul 5, 6:03 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
Quote: On Jul 5, 6:02 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
On Jul 5, 4:49 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com> wrote:
On Jul 3, 3:45 pm, iceprince <ispr... at (no spam) home.no> wrote:
Douglas Eagleson wrote:
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
A test to the encryptor.
A place to my man.
A V letter repeats making the shifted wheel always a constant and not
a variable like enigma.
So that is the answer on that riddle ?
How did you break it ?- Hide quoted text -
- Show quoted text -
I emailed the website owner and found out the answer was wrong.
I tried.- Hide quoted text -
- Show quoted text -
I tried and the answer to the Haiku was only an allusion to the
content.
Five lists of fourty characters.
Because the shifted carryover was a constant a crack method is
available. It appear to have a four character shift lever, maybe. So
as a wheel rotates one complete revolution a four space shift of the
next wheel occurs.
Like I said enigma had a variable carryover shift and the constant on
this machine allos five lists to attack.
Here is a shift crack list code.
list1(40);
list2(40);
list3(40);
list4(40);
list5(40);
for(i=0;i<(5*2^40);i++){
answer= "norweigen "the");
list1(i);
pop stack list2(i+40); //pop 50 times
pop list3(40+n); // n=4 as a guess
pop list4((40+n)*40);
pop list5((40+n)*2*40);
//and the trick is to NOT do any thing but try this pop without any
key
//after the pop put the register on the bottom of the list!
test all three sttarting letters for the phrase "the"
if successfull i 1
}- Hide quoted text -
- Show quoted text -- Hide quoted text -
- Show quoted text -
i forgot list one is poped also!- Hide quoted text -
- Show quoted text -
just rotate the index i! |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Sun Jul 20, 2008 8:18 am |
|
|
|
Guest
|
On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
Quote: http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing.
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
here is hard code for the trial method listed. I forgot to put the
abstract i in place.
I use pacific C and it does not run on vista so I need to get an old
machine out. It is just a first trial method. The pop loop indexs are
likely correct.
It is a shifted character alphabet attack.
/**************************************************/
#include <stdio.h>
main(){
unsigned char answer[] = {'T','H','E'};
unsigned char wheel1[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel2[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel3[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel4[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel5[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char temp1;
unsigned char temp2;
unsigned char temp3;
unsigned char temp4;
unsigned char temp5;
int i1,i2,i3,i4,i5;
int j1,j2,j3,j4,j5;
int times,times1,times2;
int n=4;
double limit;
double counter;
double goo;
unsigned char encrypt[]= {'E','T','S','F','V'};
limit=5*2^40;
for(j1=0;j1<=39;j1++){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
if(wheel1[0]=encrypt[0])j1=39;
}
for(j2=0;j2<=39;j2++){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
if(wheel2[0]=encrypt[1])j2=39;
}
for(j3=0;j3<=39;j3++){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
if(wheel3[0]=encrypt[2])j3=39;
}
for(j4=0;j4<=39;j4++){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
if(wheel4[0]=encrypt[3])j4=39;
}
for(j5=0;j5<=39;j5++){
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
if(wheel5[0]=encrypt[4])j5=39;
}
goo=0;
printf("begin=%c%c%c%c%c
\n",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
while(goo<limit){
for(j1=0;j1<=goo;j1++){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
}
for(j2=0;j2<=goo+39;j2++){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
}
for(j3=0;j3<=goo+39+n;j3++){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
}
for(j4=0;j4<=(goo+39+n)*39;j4++){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
}
for(j5=0;j5<=(goo+39+n)*78;j5++){
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
}
times=0;
times1=0;
times2=0;
if(wheel1[0]== answer[0])times=times+1;
if(wheel2[0]== answer[1])times=times+1;
if(wheel3[0]== answer[2])times=times+1;
if(wheel2[0]== answer[0])times1=times1+1;
if(wheel3[0]== answer[1])times1=times1+1;
if(wheel4[0]== answer[2])times1=times1+1;
if(wheel3[0]== answer[0])times2=times2+1;
if(wheel4[0]== answer[1])times2=times2+1;
if(wheel5[0]== answer[2])times2=times2+1;
if(times== 3){
counter = goo;
goo=limit;
}
if(times1==3){
counter=goo;
goo=limit;
}
if(times2 == 3){
counter=goo;
goo=limit;
}
goo=goo+1;
//printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
}//end big for loop
printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
printf("h=%i%i%i",times,times1,times2);
} |
|
|
| Back to top |
|
| Douglas Eagleson... |
Posted: Mon Jul 21, 2008 2:30 am |
|
|
|
Guest
|
On Jul 20, 11:18 am, Douglas Eagleson <eaglesondoug... at (no spam) yahoo.com>
wrote:
Quote: On Jul 3, 2:01 am, iceprince <ispr... at (no spam) home.no> wrote:
http://www.tatjavanvark.nl/tvv1/pht10.html
The poem encrypted with that machine ( from the webpage):
ETSFV FD1NV ZS7M2
UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI
QRVI8 YKK8Y
i contacted Frode Weierud about that machine, and he answered:
( translated from Norwegian):
It is not likely that anyone can break the encrypted haiku on your page,
if it is encrypted with your machine unless there is some kind of a
trick involved .
Without knowledge of the wheel connection that has a alphabet of 40
characters opposed to the enigmas 26, it is impossible.
If the clear text was known, it is possible to figure out how the
connections of the wheels. But the clear text and the encrypted text are
way to short for that method.
More info on the machines propulsion mechanism, and the numbers of
notches on each wheel are needed.
It is alt so possible that the haiku are encrypted on a machine with
only one wheel.
If that were the case the same connections will be reused after 40
characters, but it seems that the reflector wheel is mowing during the
encryption. If the reflector wheel is stationary in the process of
encryption,there should be some "clicks" on this text when it is lined
up in 40 columns, but this is not looking good.
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
^ ^
2 "cliks" on 30 characters are next to random.
He altso did a count
Here is the result:
ETSFV FD1NV ZS7M2 UM8VK RCSZA P11IN FW-KX P/1RW
1MF4L F+3,0 QHWKS H+53- ZMTBI QRVI8 YKK8Y
ABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890+-,/
****** ** **** **************** ** *****
* ** * ** ***** ** *** * * **
* * * * ** ** ** *
* * * * * *
* * *
1111150230514202234214312351211013012211
This looks very much like a monoalphabetic distribution and I therefore
suspect that the Haiku has been enciphered by using the wheel wiring
from one of the wheels as the encipherment alphabet, probably with the
letter ring set to the neutral position. Hence solving the enciphered
Haiku will reveal one of the wheel wirings, perhaps for wheel number 1?
Link to Frode Weierud's page:http://cryptocellar.org/
A list of his publications:http://cryptocellar.web.cern.ch/cryptocellar/pubs/pubs.html
I alt so mailed his answer to the woman that created that machine:
> > -----Original Message-----
> > From: ******************************
> > Sent: Wednesday, 02 July, 2008 14:05
> > To: H.Hveem
> > Cc: Frode Weierud
> > Subject: Re: your "enigma type" machine
> > Dear H. Hveem,
> > Your friend Frode makes some very clever and to-the-point
> > remarks about my encrypted haiku! All that I am willing to
> > reveal is: the system is "progressive polyalphabetic" and the
> > language can of course be any!
> > There are no tricks involved. A very short message may at
> > first appear monoalphabetic indeed. Yours is the first
> > serious attempt at de-cryption that I hear of, to my delight.
> > Thank you, good luck & best regards,
> > Tatja
Frodes answer:
Dear Tatjana,
Many thanks for your reply with the information that the system is
"progressive polyalphabetic". This explains a problem I had with it
being purely monoalphabetic. The reason for my doubt about it being
purely monoalphabetic is the fact that only four characters are missing..
If these characters are the sign characters +-,/, then it would mean
that your Haiku contains ALL the letters of the alphabet and ALL the
numbers from 0 to 9. A very strange Haiku indeed, :-)
Very best wishes,
Frode
----------------------------------------------------------------------------
Does anyone else have some opinions ?- Hide quoted text -
- Show quoted text -
here is hard code for the trial method listed. I forgot to put the
abstract i in place.
I use pacific C and it does not run on vista so I need to get an old
machine out. It is just a first trial method. The pop loop indexs are
likely correct.
It is a shifted character alphabet attack.
/**************************************************/
#include <stdio.h
main(){
unsigned char answer[] = {'T','H','E'};
unsigned char wheel1[] > { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel2[] > { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel3[] > { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel4[] > { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel5[] > { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char temp1;
unsigned char temp2;
unsigned char temp3;
unsigned char temp4;
unsigned char temp5;
int i1,i2,i3,i4,i5;
int j1,j2,j3,j4,j5;
int times,times1,times2;
int n=4;
double limit;
double counter;
double goo;
unsigned char encrypt[]= {'E','T','S','F','V'};
limit=5*2^40;
for(j1=0;j1<=39;j1++){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
if(wheel1[0]=encrypt[0])j1=39;
}
for(j2=0;j2<=39;j2++){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
if(wheel2[0]=encrypt[1])j2=39;
}
for(j3=0;j3<=39;j3++){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
if(wheel3[0]=encrypt[2])j3=39;
}
for(j4=0;j4<=39;j4++){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
if(wheel4[0]=encrypt[3])j4=39;
}
for(j5=0;j5<=39;j5++){
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
if(wheel5[0]=encrypt[4])j5=39;
}
goo=0;
printf("begin=%c%c%c%c%c
\n",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
while(goo<limit){
for(j1=0;j1<=goo;j1++){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
}
for(j2=0;j2<=goo+39;j2++){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
}
for(j3=0;j3<=goo+39+n;j3++){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
}
for(j4=0;j4<=(goo+39+n)*39;j4++){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
}
for(j5=0;j5<=(goo+39+n)*78;j5++){
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
}
times=0;
times1=0;
times2=0;
if(wheel1[0]== answer[0])times=times+1;
if(wheel2[0]== answer[1])times=times+1;
if(wheel3[0]== answer[2])times=times+1;
if(wheel2[0]== answer[0])times1=times1+1;
if(wheel3[0]== answer[1])times1=times1+1;
if(wheel4[0]== answer[2])times1=times1+1;
if(wheel3[0]== answer[0])times2=times2+1;
if(wheel4[0]== answer[1])times2=times2+1;
if(wheel5[0]== answer[2])times2=times2+1;
if(times== 3){
counter = goo;
goo=limit;
}
if(times1==3){
counter=goo;
goo=limit;
}
if(times2 == 3){
counter=goo;
goo=limit;
}
goo=goo+1;
//printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
}//end big for loop
printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
printf("h=%i%i%i",times,times1,times2);
}- Hide quoted text -
- Show quoted text -- Hide quoted text -
- Show quoted text -
I changed the integer for loops to double while loops
/
********************************************************************************/
#include <stdio.h>
main(){
unsigned char answer[] = {'T','H','E'};
unsigned char wheel1[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel2[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel3[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel4[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char wheel5[] { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','1','2','3','4','5','6','7','8','9','0','+','-',',','/'};
unsigned char temp1;
unsigned char temp2;
unsigned char temp3;
unsigned char temp4;
unsigned char temp5;
int i1,i2,i3,i4,i5;
double j1,j2,j3,j4,j5;
int times,times1,times2;
int n=4;
double limit;
double counter;
double goo;
unsigned char encrypt[]= {'E','T','S','F','V'};
limit=5*(2^40);
for(j1=0;j1<=39;j1++){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
if(wheel1[0]=encrypt[0])j1=39;
}
for(j2=0;j2<=39;j2++){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
if(wheel2[0]=encrypt[1])j2=39;
}
for(j3=0;j3<=39;j3++){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
if(wheel3[0]=encrypt[2])j3=39;
}
for(j4=0;j4<=39;j4++){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
if(wheel4[0]=encrypt[3])j4=39;
}
for(j5=0;j5<=39;j5++){
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
if(wheel5[0]=encrypt[4])j5=39;
}
goo=0;
printf("begin=%c%c%c%c%c
\n",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
while(goo<limit){
j1=0;
while(j1<=goo){
temp1=wheel1[0];
for(i1=0;i1<=38;i1++){
wheel1[i1]=wheel1[i1+1];
}
wheel1[39]=temp1;
j1=j1+1;
}
j2=0;
while(j2<=goo+39){
temp2=wheel2[0];
for(i2=0;i2<=38;i2++){
wheel2[i2]=wheel2[i2+1];
}
wheel2[39]=temp2;
j2=j2+1;
}
j3=0;
while(j3<=goo+39+n){
temp3=wheel3[0];
for(i3=0;i3<=38;i3++){
wheel3[i3]=wheel3[i3+1];
}
wheel3[39]=temp1;
j3=j3+1;
}
j4=0;
while(j4<=(goo+39+n)*39){
temp4=wheel4[0];
for(i4=0;i4<=38;i4++){
wheel4[i4]=wheel4[i4+1];
}
wheel4[39]=temp4;
j4=j4+1;
}
j5=0;
while(j5<=(goo+39+n)*7 {
temp5=wheel5[0];
for(i5=0;i5<=38;i5++){
wheel5[i5]=wheel5[i5+1];
}
wheel5[39]=temp5;
j5=j5+1;
}
times=0;
times1=0;
times2=0;
if(wheel1[0]== answer[0])times=times+1;
if(wheel2[0]== answer[1])times=times+1;
if(wheel3[0]== answer[2])times=times+1;
if(wheel2[0]== answer[0])times1=times1+1;
if(wheel3[0]== answer[1])times1=times1+1;
if(wheel4[0]== answer[2])times1=times1+1;
if(wheel3[0]== answer[0])times2=times2+1;
if(wheel4[0]== answer[1])times2=times2+1;
if(wheel5[0]== answer[2])times2=times2+1;
if(times== 3){
counter = goo;
goo=limit;
}
if(times1==3){
counter=goo;
goo=limit;
}
if(times2 == 3){
counter=goo;
goo=limit;
}
goo=goo+1;
//printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
}//end big for loop
printf("answer=%c%c%c%c
%c",wheel1[0],wheel2[0],wheel3[0],wheel4[0],wheel5[0]);
printf("h=%i%i%i",times,times1,times2);
printf("counter=%e",counter);
} |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Sat Aug 30, 2008 10:26 am
|
|