| |
 |
|
|
Science Forum Index » Cryptography Forum » Does Base64 encoding before encryption makes it easier to br
Page 1 of 2 Goto page 1, 2 Next
|
| Author |
Message |
| Goh, Yong Kwang |
Posted: Sun Dec 28, 2003 8:51 am |
|
|
|
Guest
|
Hi.
I would like to find out if I apply base 64 encoding to a binary
file/stream before applying symmetric encryption, will the resulting
ciphertext be easier to break and cryptanalyzed?
I've only some basic understanding of encryption and mathematics and
is not quite sure how the base 64 encoding would affect the security
of the ciphertext and encryption.
But to me it may reduce the security because base 64 encoding reduces
the number of symbols (characters) used to represent the plaintext. In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier for
the attacker to do some statistical cryptanalysis.
Any comment will be appreciated.
Thank you.
---
Goh, Yong-Kwang
Singapore
gohyongkwang@hotmail.com |
|
|
| Back to top |
|
| Richard Heathfield |
Posted: Sun Dec 28, 2003 8:51 am |
|
|
|
Guest
|
John Savard wrote:
Quote: On 28 Dec 2003 05:51:56 -0800, gohyongkwang@hotmail.com (Goh, Yong
Kwang) wrote, in part:
I would like to find out if I apply base 64 encoding to a binary
file/stream before applying symmetric encryption, will the resulting
ciphertext be easier to break and cryptanalyzed?
Yes and no.
Yes, in general, because the limitation to 64 symbols creates
redundancy, which can be used in cryptanalysis.
No, in particular, because modern block ciphers have key sizes immune
to brute-force search, and are secure against known-plaintext attack.
But it's a bad idea anyways, because it leads to having to use the
encryption algorithm more times, thus it leads to inefficiency.
And, in fact, it's a waste of time, because you'll only have to base-64
encode it again before emailing it to the legitimate recipient. :-)
--
Richard Heathfield : binary@eton.powernet.co.uk
"Usenet is a strange place." - Dennis M Ritchie, 29 July 1999.
C FAQ: http://www.eskimo.com/~scs/C-faq/top.html
K&R answers, C books, etc: http://users.powernet.co.uk/eton |
|
|
| Back to top |
|
| John Savard |
Posted: Sun Dec 28, 2003 9:24 am |
|
|
|
Guest
|
On 28 Dec 2003 05:51:56 -0800, gohyongkwang@hotmail.com (Goh, Yong
Kwang) wrote, in part:
Quote: I would like to find out if I apply base 64 encoding to a binary
file/stream before applying symmetric encryption, will the resulting
ciphertext be easier to break and cryptanalyzed?
Yes and no.
Yes, in general, because the limitation to 64 symbols creates
redundancy, which can be used in cryptanalysis.
No, in particular, because modern block ciphers have key sizes immune
to brute-force search, and are secure against known-plaintext attack.
But it's a bad idea anyways, because it leads to having to use the
encryption algorithm more times, thus it leads to inefficiency.
John Savard
http://home.ecn.ab.ca/~jsavard/index.html |
|
|
| Back to top |
|
| Bill Unruh |
Posted: Sun Dec 28, 2003 11:18 am |
|
|
|
Guest
|
gohyongkwang@hotmail.com (Goh, Yong Kwang) writes:
]Hi.
]I would like to find out if I apply base 64 encoding to a binary
]file/stream before applying symmetric encryption, will the resulting
]ciphertext be easier to break and cryptanalyzed?
Yes. BAse64 encoding replaces the 3 8 bit bytes of binary by 4 6 bit
bytes, made up of printable characters only. Thus on decoding the
attacker need only check to make sure that each byte is one of the
base64 characters. If not, it is not the right key.
However, this is not much of an advantage. He would still have to use
exhaustive search to find the right key. It just makes it easier to
determine if he has the right key.
(Ie, the "easier" is not much)
]I've only some basic understanding of encryption and mathematics and
]is not quite sure how the base 64 encoding would affect the security
]of the ciphertext and encryption.
]But to me it may reduce the security because base 64 encoding reduces
]the number of symbols (characters) used to represent the plaintext. In
]original binary mode, there would be 256 combinations for each byte.
]Whereas in base 64 encoding, there would be only 65 combinations in
]use for each byte, thus my rationale is that it may make it easier for
]the attacker to do some statistical cryptanalysis.
]Any comment will be appreciated.
]Thank you.
]---
]Goh, Yong-Kwang
]Singapore
]gohyongkwang@hotmail.com |
|
|
| Back to top |
|
| David A. Scott |
Posted: Sun Dec 28, 2003 12:29 pm |
|
|
|
Guest
|
gohyongkwang@hotmail.com (Goh, Yong Kwang) wrote in
news:354933d6.0312280551.7a348578@posting.google.com:
Quote: Hi.
I would like to find out if I apply base 64 encoding to a binary
file/stream before applying symmetric encryption, will the resulting
ciphertext be easier to break and cryptanalyzed?
I've only some basic understanding of encryption and mathematics and
is not quite sure how the base 64 encoding would affect the security
of the ciphertext and encryption.
But to me it may reduce the security because base 64 encoding reduces
the number of symbols (characters) used to represent the plaintext. In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier for
the attacker to do some statistical cryptanalysis.
Any comment will be appreciated.
Thank you.
If you have printable text and change it from a set of 256 valuses
to a set of 64 values it would increase the "Unicity Distance" making
it safer.
But you have to convert corretcly. Most ways to do this would add
some redunency making it easier to break. I would use a bijective
conditioned compressor. There are some at my site. then reverse file
and give it another pass say with arb255.exe then reverse again and
encrypt with something like BICOM a bijective compressor which has
built in full size AES encryptio.
David A. Scott
--
My Crypto code
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott19u.zip
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott16u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link" |
|
|
| Back to top |
|
| David A. Scott |
Posted: Sun Dec 28, 2003 12:45 pm |
|
|
|
Guest
|
|
| Back to top |
|
| Michael Amling |
Posted: Sun Dec 28, 2003 5:59 pm |
|
|
|
Guest
|
Bill Unruh wrote:
Quote: gohyongkwang@hotmail.com (Goh, Yong Kwang) writes:
]Hi.
]I would like to find out if I apply base 64 encoding to a binary
]file/stream before applying symmetric encryption, will the resulting
]ciphertext be easier to break and cryptanalyzed?
Yes. BAse64 encoding replaces the 3 8 bit bytes of binary by 4 6 bit
bytes, made up of printable characters only. Thus on decoding the
attacker need only check to make sure that each byte is one of the
base64 characters. If not, it is not the right key.
However, this is not much of an advantage. He would still have to use
exhaustive search to find the right key. It just makes it easier to
determine if he has the right key.
(Ie, the "easier" is not much)
Yes, and no one has established that the binary can't be recognized,
anyway.
Quote:
]I've only some basic understanding of encryption and mathematics and
]is not quite sure how the base 64 encoding would affect the security
]of the ciphertext and encryption.
Why not just use an encryption algorithm and mode that provide
confidentiality and authenticity for all plaintexts?
Quote: ]But to me it may reduce the security because base 64 encoding reduces
]the number of symbols (characters) used to represent the plaintext. In
]original binary mode, there would be 256 combinations for each byte.
]Whereas in base 64 encoding, there would be only 65 combinations in
]use for each byte, thus my rationale is that it may make it easier for
]the attacker to do some statistical cryptanalysis.
There are far more worrisome things to worry about, such as selecting
a key at random, choosing a password of high entropy, foiling
keyloggers, and so on.
--Mike Amling |
|
|
| Back to top |
|
| Mok-Kong Shen |
Posted: Sun Dec 28, 2003 6:57 pm |
|
|
|
Guest
|
"Goh, Yong Kwang" wrote:
Quote:
[snip]
But to me it may reduce the security because base 64 encoding reduces
the number of symbols (characters) used to represent the plaintext. In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier for
the attacker to do some statistical cryptanalysis.
But this (reversible) conversion doesn't involve any
encryption key. So the two forms are simply equivalent
'representations' of the same thing and thus shouldn't
inherently affect the statistical properties in them.
It may also be noted that the 'bytes' in the original
material are just arbitrary groupings. You could also
concentrate your 'view' on the individual bits as units.
Then there are only two symbols (instead of the 256 you
mentioned), but would you therefore conclude, using
the same sort of reasoning/feeling that you have, that
there would be difference in hardness of the work of
the opponent (without now any change/encoding of the
given stuff)?
M. K. Shen |
|
|
| Back to top |
|
| John E. Hadstate |
Posted: Mon Dec 29, 2003 7:12 am |
|
|
|
Guest
|
"Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote in message
news:3FEF6DE4.8C7BA625@t-online.de...
Quote:
"Goh, Yong Kwang" wrote:
[snip]
But to me it may reduce the security because base 64 encoding reduces
the number of symbols (characters) used to represent the plaintext. In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier for
the attacker to do some statistical cryptanalysis.
But this (reversible) conversion doesn't involve any
encryption key. So the two forms are simply equivalent
'representations' of the same thing and thus shouldn't
inherently affect the statistical properties in them.
This may require a little more thought. First, a (reversible) keyed AES
encipherment of a block of 16 plaintext bytes is a "simply equivalent
representation of the same thing" and yet the statistical properties of the
ciphertext will differ wildly from those of the plaintext.
Second, the analysis of the statistical properties of Base-64 encoding must
show *Zero* probability that one will ever see bit combinations outside of
the basic set of characters (A-Z, a-z, and a few others) regardless of the
distribution of bit patterns in the source material--another example of a
change in statistical properties by an unkeyed reversible conversion.
Third, Base-64 encoding can be considered to be a polygraphic,
polyalphabetic substitution cipher with a fixed, known key and a relatively
short period.
Base-64 encoding adds no entropy to the plaintext, but it does increase the
amount of plaintext available and provides a signature for cryptanalysis in
the form of a characteristic probability distribution. It is a "data
armoring" technique historically used to ensure that natively 8-bit
character data can be routed through legacy communication systems that were
limited to processing 7-bit characters. |
|
|
| Back to top |
|
| David A. Scott |
Posted: Mon Dec 29, 2003 11:07 am |
|
|
|
Guest
|
"John E. Hadstate" <jh113355@hotmail.com> wrote in
news:9SUHb.44263$Ol1.26826@bignews3.bellsouth.net:
Quote:
"Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote in message
news:3FEF6DE4.8C7BA625@t-online.de...
"Goh, Yong Kwang" wrote:
[snip]
But to me it may reduce the security because base 64 encoding
reduces the number of symbols (characters) used to represent the
plaintext. In original binary mode, there would be 256 combinations
for each byte. Whereas in base 64 encoding, there would be only 65
combinations in use for each byte, thus my rationale is that it may
make it easier for the attacker to do some statistical
cryptanalysis.
But this (reversible) conversion doesn't involve any
encryption key. So the two forms are simply equivalent
'representations' of the same thing and thus shouldn't
inherently affect the statistical properties in them.
This may require a little more thought. First, a (reversible) keyed
AES encipherment of a block of 16 plaintext bytes is a "simply
equivalent representation of the same thing" and yet the statistical
properties of the ciphertext will differ wildly from those of the
plaintext.
Second, the analysis of the statistical properties of Base-64 encoding
must show *Zero* probability that one will ever see bit combinations
outside of the basic set of characters (A-Z, a-z, and a few others)
regardless of the distribution of bit patterns in the source
material--another example of a change in statistical properties by an
unkeyed reversible conversion.
Third, Base-64 encoding can be considered to be a polygraphic,
polyalphabetic substitution cipher with a fixed, known key and a
relatively short period.
Base-64 encoding adds no entropy to the plaintext, but it does
increase the amount of plaintext available and provides a signature
for cryptanalysis in the form of a characteristic probability
distribution. It is a "data armoring" technique historically used to
ensure that natively 8-bit character data can be routed through legacy
communication systems that were limited to processing 7-bit
characters.
I may have viewed this wrong in an earlyer post. If you expand a
file by changing 3 bytes 24 bits to 4 ascii character each of which
can only take on 64 values. You expand the file making down stream
encryption less safe. Note every 24 bits becomes 32 bits for some
reason in an earler post I veiwed the problem as takeing a subset of
ascii character from a text file and then using 6 bits packing to compress
int file. Clearly I misunderstood the problem. But compression is
good expansion before general encryption is bad.
Example suspose you have a large set of messages which compress
to exactly 8 bytes or 64 bits. You could encrypt suspose you encrypt
by xor a 64 bit key. With the compressed set you have "perfect security"
Since no matter what key he tries each lead to a possible message in
the input set of 2**64 messages.
Suspose you expand this. It would expand to 85+ bits forget
the padding problem. Know xor the same key to the blocks. Note the
place where you know the expansion has zeros. When some one intercepts
they know some of the key materal right away the effective key space as
gone down from 2**64 to 2**56 eliminating most of the possible messages.
IN fact depending on how you pad and know range on possible ascii values
much more it is given to the attacker.
David A. Scott
--
My Crypto code
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott19u.zip
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott16u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link" |
|
|
| Back to top |
|
| Mok-Kong Shen |
Posted: Mon Dec 29, 2003 12:31 pm |
|
|
|
Guest
|
"John E. Hadstate" wrote:
Quote:
"Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote:
"Goh, Yong Kwang" wrote:
[snip]
But to me it may reduce the security because base 64 encoding reduces
the number of symbols (characters) used to represent the plaintext. In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier for
the attacker to do some statistical cryptanalysis.
But this (reversible) conversion doesn't involve any
encryption key. So the two forms are simply equivalent
'representations' of the same thing and thus shouldn't
inherently affect the statistical properties in them.
This may require a little more thought. First, a (reversible) keyed AES
encipherment of a block of 16 plaintext bytes is a "simply equivalent
representation of the same thing" and yet the statistical properties of the
ciphertext will differ wildly from those of the plaintext.
[snip]
But here (as I called attention to) a key is involved
and that key is kept unknown to the opponent. This is
a secret transformation not a 'public' transformation.
The opponent, if he is capable, will try all that is
at his disposal. A transform that is 'known' to him,
doesn't cause any trouble to him (we neglect some
resources that would be needed e.g. to back-transform).
Consider also this example: A 128-bit block can e.g. be
represented as 4 integers in hex format or in decimal
digits format. Does the one form contain more
'information' than the other? (Note that the 'base' of
the two are different.) Of course, the opponent, in doing
his statistical analysis, may try certain different
equivalent formats and some would be more appropriate
or convenient than the others. Since he can anyways e.g.
get back the binary form from the base64 encoding, there
is nothing hindering his operating (also) on the original
binary format. It follows trivially that the base64
encoding (since it is 'known' to him) neither increases
nor decreases the security. This is the essence of what
I wanted to say.
M. K. Shen |
|
|
| Back to top |
|
| Bill Unruh |
Posted: Mon Dec 29, 2003 12:34 pm |
|
|
|
Guest
|
Mok-Kong Shen <mok-kong.shen@t-online.de> writes:
]"John E. Hadstate" wrote:
]>
]> "Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote:
]> >
]> > "Goh, Yong Kwang" wrote:
]> > >
]> > [snip]
]> > > But to me it may reduce the security because base 64 encoding reduces
]> > > the number of symbols (characters) used to represent the plaintext. In
]> > > original binary mode, there would be 256 combinations for each byte.
]> > > Whereas in base 64 encoding, there would be only 65 combinations in
]> > > use for each byte, thus my rationale is that it may make it easier for
]> > > the attacker to do some statistical cryptanalysis.
]> >
]> > But this (reversible) conversion doesn't involve any
]> > encryption key. So the two forms are simply equivalent
]> > 'representations' of the same thing and thus shouldn't
]> > inherently affect the statistical properties in them.
]>
]> This may require a little more thought. First, a (reversible) keyed AES
]> encipherment of a block of 16 plaintext bytes is a "simply equivalent
]> representation of the same thing" and yet the statistical properties of the
]> ciphertext will differ wildly from those of the plaintext.
][snip]
]But here (as I called attention to) a key is involved
]and that key is kept unknown to the opponent. This is
]a secret transformation not a 'public' transformation.
]The opponent, if he is capable, will try all that is
]at his disposal. A transform that is 'known' to him,
]doesn't cause any trouble to him (we neglect some
]resources that would be needed e.g. to back-transform).
]Consider also this example: A 128-bit block can e.g. be
]represented as 4 integers in hex format or in decimal
]digits format. Does the one form contain more
]'information' than the other? (Note that the 'base' of
]the two are different.) Of course, the opponent, in doing
]his statistical analysis, may try certain different
]equivalent formats and some would be more appropriate
]or convenient than the others. Since he can anyways e.g.
]get back the binary form from the base64 encoding, there
]is nothing hindering his operating (also) on the original
]binary format. It follows trivially that the base64
]encoding (since it is 'known' to him) neither increases
]nor decreases the security. This is the essence of what
]I wanted to say.
But it does. The base 64 encoding means that there is a pattern in the
source-- only 6 bits are used, although the bytes are still 8 bits long.
Ie, the source text has been expanded by effectively padding out each
six bits of the source by two zero bits. Those two zero bits in each 8
bits are a pattern that the cryptanalysis can use.
Now, since most crypto systems are resistant to known plaintext attacks,
those two zero bits are a form of known plaintext.
Also, any encryption is a substitution cypher. In this case, instead of
the whole of the 2^64 possible outputs, there will only be 2^48 possible
outputs, since there are only 2^48 possible inputs. The non-occuring
outputs therefor also give a possible attack on the cypher. (Mind you
that will require a fair amount of text-- 2^48 is 10^15 and the text
would need to be longer than that to ensure that all of the possible
inputs had actually occured). |
|
|
| Back to top |
|
| Bill Unruh |
Posted: Mon Dec 29, 2003 12:39 pm |
|
|
|
Guest
|
Mok-Kong Shen <mok-kong.shen@t-online.de> writes:
]"John E. Hadstate" wrote:
]>
]> "Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote:
]> >
]> > "Goh, Yong Kwang" wrote:
]> > >
]> > [snip]
]> > > But to me it may reduce the security because base 64 encoding reduces
]> > > the number of symbols (characters) used to represent the plaintext. In
]> > > original binary mode, there would be 256 combinations for each byte.
]> > > Whereas in base 64 encoding, there would be only 65 combinations in
]> > > use for each byte, thus my rationale is that it may make it easier for
]> > > the attacker to do some statistical cryptanalysis.
]> >
]> > But this (reversible) conversion doesn't involve any
]> > encryption key. So the two forms are simply equivalent
]> > 'representations' of the same thing and thus shouldn't
]> > inherently affect the statistical properties in them.
]>
]> This may require a little more thought. First, a (reversible) keyed AES
]> encipherment of a block of 16 plaintext bytes is a "simply equivalent
]> representation of the same thing" and yet the statistical properties of the
]> ciphertext will differ wildly from those of the plaintext.
][snip]
]But here (as I called attention to) a key is involved
]and that key is kept unknown to the opponent. This is
]a secret transformation not a 'public' transformation.
]The opponent, if he is capable, will try all that is
]at his disposal. A transform that is 'known' to him,
]doesn't cause any trouble to him (we neglect some
]resources that would be needed e.g. to back-transform).
]Consider also this example: A 128-bit block can e.g. be
]represented as 4 integers in hex format or in decimal
]digits format. Does the one form contain more
]'information' than the other? (Note that the 'base' of
]the two are different.) Of course, the opponent, in doing
]his statistical analysis, may try certain different
]equivalent formats and some would be more appropriate
]or convenient than the others. Since he can anyways e.g.
]get back the binary form from the base64 encoding, there
]is nothing hindering his operating (also) on the original
]binary format. It follows trivially that the base64
]encoding (since it is 'known' to him) neither increases
]nor decreases the security. This is the essence of what
]I wanted to say.
Let me do this in a slighly different way. Lets look at the following
encoding. Each bit of the source is expanded that the value of each 1
bit is the 8 bytes 0x8000000000000000 and each 0 bit is the 8 bytes
0x00000000000000. Now the encoded text clearly has exactly the same
information as the original (it is only 64 times as long). But
cryptanalysis of this is trivial. There will only be two outputs for
each 64 bit block of the output. One of these is 1 and the other is 0.
This means after two tries the enemy will know what the message is.
ie, this base1 encoding is horribly weak, even though your argument
could be applied to it. |
|
|
| Back to top |
|
| Matthew Skala |
Posted: Mon Dec 29, 2003 5:53 pm |
|
|
|
Guest
|
In article <bsqaeb$iko$1@string.physics.ubc.ca>,
Bill Unruh <unruh@string.physics.ubc.ca> wrote:
Quote: encoding. Each bit of the source is expanded that the value of each 1
bit is the 8 bytes 0x8000000000000000 and each 0 bit is the 8 bytes
0x00000000000000. Now the encoded text clearly has exactly the same
information as the original (it is only 64 times as long). But
cryptanalysis of this is trivial. There will only be two outputs for
each 64 bit block of the output. One of these is 1 and the other is 0.
You seem to be assuming ECB mode.
--
Matthew Skala
mskala@ansuz.sooke.bc.ca Embrace and defend.
http://ansuz.sooke.bc.ca/ |
|
|
| Back to top |
|
| John E. Hadstate |
Posted: Mon Dec 29, 2003 7:48 pm |
|
|
|
Guest
|
"Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote in message
news:3FF064E1.5B767CA3@t-online.de...
Quote:
"John E. Hadstate" wrote:
"Mok-Kong Shen" <mok-kong.shen@t-online.de> wrote:
"Goh, Yong Kwang" wrote:
[snip]
But to me it may reduce the security because base 64 encoding
reduces
the number of symbols (characters) used to represent the plaintext.
In
original binary mode, there would be 256 combinations for each byte.
Whereas in base 64 encoding, there would be only 65 combinations in
use for each byte, thus my rationale is that it may make it easier
for
the attacker to do some statistical cryptanalysis.
But this (reversible) conversion doesn't involve any
encryption key. So the two forms are simply equivalent
'representations' of the same thing and thus shouldn't
inherently affect the statistical properties in them.
This may require a little more thought. First, a (reversible) keyed AES
encipherment of a block of 16 plaintext bytes is a "simply equivalent
representation of the same thing" and yet the statistical properties of
the
ciphertext will differ wildly from those of the plaintext.
[snip]
But here (as I called attention to) a key is involved
and that key is kept unknown to the opponent. This is
a secret transformation not a 'public' transformation.
The opponent, if he is capable, will try all that is
at his disposal. A transform that is 'known' to him,
doesn't cause any trouble to him (we neglect some
resources that would be needed e.g. to back-transform).
I believe your assertion was that:
the two forms are simply equivalent
'representations' of the same thing
and thus shouldn't inherently affect
the statistical properties in them.
To me, this implies a claim that a reversible transform will not affect the
statistical properties of the input. My reference to AES, an example of a
reversible transform, was to demonstrate that the transform itself can
produce radical changes in the statistical properties.
My next paragraph, which you snipped, directly addressed the Base-64
encoding transform. This transform is also reversible and it also
dramatically affects the statistical properties.
It still appears to me that your assertion requires a little more thought.
Quote: Consider also this example: A 128-bit block can e.g. be
represented as 4 integers in hex format or in decimal
digits format. Does the one form contain more
'information' than the other? (Note that the 'base' of
the two are different.)
No, on this we agree; the information content contained in the encoded
message doesn't change as a result of encoding but....
Quote: Of course, the opponent, in doing
his statistical analysis, may try certain different
equivalent formats and some would be more appropriate
or convenient than the others.
I think we're starting to stray from the path of righteousness here. By
encoding a message as Base-64 or as hexadecimal, we added information to the
plaintext that is unimportant to the intended recipient. In decoding the
plaintext, we will filter this information out for the convenience of the
recipient.
However, the cryptanalyst will analyze the unfiltered plaintext and, under
one very special condition, will instantly recognize that it is hexadecimal
or Base-64 encoding. This is very useful information. Do you see why? |
|
|
| Back to top |
|
| |
Page 1 of 2 Goto page 1, 2 Next
All times are GMT - 5 Hours
The time now is Fri Oct 10, 2008 11:37 pm
|
|