Re: --really newbie-- most frequent character
- From: John <tandauioan@xxxxxxxxx>
- Date: Thu, 28 Apr 2005 21:42:32 -0400
It depends on the way the keys are handled. For example using a
symetrical encryption algorithm
using XOR can be really hard to break if only the two people
communicating are using the key and
the key is long enough. The key elements have to be applied in sequence
on the original sequence.
This means that if you have the same character on a number of positions,
chances that it will show
up with the same substitution are slim. There's really no way of
breaking the code using the method
you are trying to use.
Fred L. Kleinschmidt wrote:
>
> Gin wrote:
>
>>Hi everyone,
>>
>>I struggling with java here. Can anyone tell me how to pick up the most
>>frequent character in a string?
>>I've browsed the API but I am just lost.
>>
>>What I intend to do is decrypt a string without a code given? Like
>>there's a most frequent letter in english which is 'e' so i want to
>>pick the most frequent letter from the encrypted string and assign it
>>'e'.
>>
>>A bit messy, but I hope you get the idea.
>>
>>Thank you so much!
>
>
> I hope you realize that only the most naive encryption methods use a
> simple letter substitution scheme. Essentially every encryption method
> in use today is quite different than that. For example, the encryption
> of the string "aaaaa" will probably not be 5 characters long; it is more
> likely to be something like "zyQ:5jnW7Wm"
>
.
- References:
- Prev by Date: Re: Cross tabulation - someone please help if you can
- Next by Date: Re: uploading files..
- Previous by thread: Re: --really newbie-- most frequent character
- Next by thread: Cookies in a https post request
- Index(es):
Relevant Pages
|