??? 06/04/05 20:01 Read: times |
#94348 - I expected that... Responding to: ???'s previous message |
Of course the answer is wrong, but what is the result of encypher exactly?
Or, even better, give the result of each round. When I am debugging algorithms such as these, I always write a counterpart of the algorithm on PC and try to go and compare step-by-step. So it is interesting to see the result of sum, y and z after the first round and compare it to that obtained on PC. Btw. you can still use my asm implementation from the codelibrary, if you know how to use asm in C. Jan Waclawek PS. Endianness should not be an issue if the encryption and decryption is done on a machine with the same endianness. Nevertheless, there are too many pitfalls in implicit retyping and pointer conversion in C... |
Topic | Author | Date |
TEA | 01/01/70 00:00 | |
Endianess | 01/01/70 00:00 | |
Any recommendations? | 01/01/70 00:00 | |
Assess your requirements | 01/01/70 00:00 | |
Test vectors | 01/01/70 00:00 | |
platform-dependent | 01/01/70 00:00 | |
Why TEA? | 01/01/70 00:00 | |
Did you Mean DES | 01/01/70 00:00 | |
Yes, DES | 01/01/70 00:00 | |
Here it is | 01/01/70 00:00 | |
It would be better | 01/01/70 00:00 | |
Go here! | 01/01/70 00:00 | |
And what is your result? | 01/01/70 00:00 | |
Not right? | 01/01/70 00:00 | |
I expected that... | 01/01/70 00:00 | |
Here are the results I am gettng | 01/01/70 00:00 | |
Michael is right: | 01/01/70 00:00 | |
MS Visual C. | 01/01/70 00:00 | |
Recipe for success | 01/01/70 00:00 | |
problem with "standard implementation".. | 01/01/70 00:00 | |
Example for the user | 01/01/70 00:00 | |
like this? | 01/01/70 00:00 | |
What else? | 01/01/70 00:00 | |
??? | 01/01/70 00:00 | |
I noticed that![]() | 01/01/70 00:00 | |
Statics init to zero | 01/01/70 00:00 | |
Code Problems | 01/01/70 00:00 | |
Didn't search first? | 01/01/70 00:00 | |
It's easy? | 01/01/70 00:00 | |
Useful fast shift and roll functions | 01/01/70 00:00 |