Hi,
Consider a map, with N bus stations, and there are total L bus lines
operating on this set of stations
1. Each line follow a particular path, it might not be symmetric (i.e.
the path from placeA= placeB might be different from placeB to
placeA)
2. Some statations are shared by several
L7 寫道:
Do you mean a 'mapping'?
i.e.
1 -- 4
2 -- 3
3 -- 2
4 -- 1
Where -- means 'maps to'.
Or do you want to arrange the bits so that there is always a different
result after the operation?
i.e.
1 -- [0..0x]
2 -- [0..0x]
...
Any ouput is valid given an integer input.
i
L7 wrote:
Easy to guess is relative.
Actually, any mapping from int to int is an (equally) easy one to
guess. The encryption part would be to change the mapping on each int
or sequence of ints by a rotation or equation.
int - int ( '-' represents a map from one to another)
Provides 0x
If I want to encrypt an interger (4 bytes) to another interger , e.g.
which algorithm is well known for performance security?
thanks.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Hi geek, consider the following suitation...
1. a server, response to incoming users with a random generated string
(less than 255 bytes)
2. a user, might request to a server at the same time, i.e. within the
same second of time
3. within a second, the requests might be as high as 1000
4. the
Vijendra Singh 寫道:
You can use SHA-1 or in fact any of the SHA family depending upon ur actual
requirements. as of today, both MD-5 and SHA-1 stand compromised but might
prove good enough for ur application.
http://en.wikipedia.org/wiki/SHA-1
-Vijju
On 10/31/06, howa [EMAIL PROTECTED
Requirements:
A string, size up to 10 MB
I want to hash the string (without collosion, into a key with length
not longer than 255)
currently, I am using md5, I want to ask, are there any better
algorithms?
--~--~-~--~~~---~--~~
You received this message
Hi,
Is that in-order search of BST = depth first search?
thanks.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To