Timeline for Types of Cryptography for a 4-8 bit microcontroller
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2014 at 10:57 | comment | added | user4982 | Two statements "The initial s and y values (32 bits total) can be done using a simple diffie helman type algorithm." and "y starts off as 0" conflict with each other. In either case, the seed is either 16 bits or 32 bits, which is not sufficient, even with otherwise secure algorithm. This algorithm, however, is broken with a few known plaintext and ciphertext bytes (resulting in simple linear equations which can be solved by hand in matter of minutes). Thus, the algorithm is not a good idea. | |
| Nov 8, 2013 at 21:00 | comment | added | e-sushi | Well, I call this algorithm "Pseudo Random Number Generator" because that's what it is. | |
| Aug 16, 2013 at 14:37 | comment | added | CodesInChaos | Why do you mention diffie-hellman? Your code doesn't have anything in common with DH. DH takes at least million cycles. If you can afford DH, you can afford a sane symmetric algo. There is also the whole field of lightweight crypto that attempts to construct cheap but secure crypto. Unlike your system which seems about as secure as caesar encryption. | |
| Aug 16, 2013 at 13:57 | comment | added | Gilles 'SO- stop being evil' | Hey, an algorithm I hadn't heard of. Where is peer-reviewed literature about that algorithm? | |
| S Aug 14, 2013 at 21:47 | history | suggested | e-sushi | CC BY-SA 3.0 |
Typo corrections and reformatting.
|
| Aug 14, 2013 at 20:40 | review | Suggested edits | |||
| S Aug 14, 2013 at 21:47 | |||||
| S Aug 14, 2013 at 19:10 | review | Late answers | |||
| Aug 14, 2013 at 20:40 | |||||
| S Aug 14, 2013 at 19:10 | review | First posts | |||
| Aug 14, 2013 at 20:40 | |||||
| Aug 14, 2013 at 18:52 | history | answered | Donald Murray | CC BY-SA 3.0 |