hardware - Need a very fast one-to-one algorithm, possibly encryption -
I need a very fast, one-to-one algorithm. I do not need to unify the algorithms appropriately Strong enough, but it should be fast electricity. I am implementing it in hardware area is also a matter of concern, so it should not use too much logic.
This function should be F_N (x) whose input is an N-bit number and whose output is N-bit number. N is a constant, maybe between 20-70s the function should be one-by-one (i.e. invertable, which means that decryption is possible. The speed of the decryption is irrelevant.)
Let me under 3ns Need to encrypt, which is 333m input per second, DES, for example, approximately 50 mbits per second, I need 333m input per second
now Until I had a fistol cipher with about 6 rounds Abuse am. It seems that about 3ns.
Suggestions?
More notes
There are some questions, so I will explain that I have to put the keys in a hash table, the standard method is to hash input key and a table Use the results as. Each row in the table should store the original key. Tells us that the lines in the table do not really need to be wider as input keys, but the number of bits in the address of the table is equal to less input key. For example:
- Input: x (n bit)
- hash: x% 128 (8 bit)
- Verifier: floor (x / 128) (N-8 beats)
It would be silly on a CPU where the integer is usually the same width but I am doing it in hardware.
x% 128 is an easy hash to break. In fact, if the input key only varies in the first bits of bits, then you have broken the hash into an accident. I need a mustache which will not be broken in the accident and it may also be difficult to break the purpose. I have also tried an LFSR faster but two LFSRs of the same length produce the result which is related to the graphs. (If F (X) and G (X) give the same hashes for two different polynomials, F (x + 1) and g (x + 1) are easily correlated.)
Therefore, I have a function with N-bit input and V-bit, H-bit output (V + H = N), where it is difficult to get two inputs of length such as both H. The output of the encryption will be out. The output length is similar to the input and it is difficult to reverse. Anything else except encryption can work, however, it seems like what I want is almost the very definition of encryption.
Sorry to not clarify this all-up front, hope that it clarifies things.
When you say "fast" What is latency?
If latency is not significant enough then there is no reason why you can not use the standard that is known to be safe, and with the complete number combination logic Production of output (eg 16 in blofish), stick a register between each round, so that you can pipeline the encryption algorithm? This essentially requires the same amount of hardware as a similar secure encryption algorithm (slightly more for adding some flip-flops to the registers), but the spread delay will only be one round of the Feistel network + the promotion Spread delay flip-flops
Comments
Post a Comment