Talk:Main step of GOST 28147-89: Difference between revisions
Talk:Main step of GOST 28147-89 (view source)
Revision as of 19:09, 20 September 2012
, 11 years ago→task specifics: verification example
(→task specifics: got some links in) |
(→task specifics: verification example) |
||
Line 36:
: As you can see, I have given a description of two embodiments of the algorithm: the classical and variant with a compressed table changes. The latter has traditionally been used in implementations on low-level languages, and the first is more beautiful and obvious, therefore, in my opinion, it is better to start with him (option for "JavaScript"). [[User:Русский|Русский]] 13:17, 8 September 2012 (UTC)
:: Ah, cool! Wikipedia has some relevant links. (I didn't know it was a Feistel network…) –[[User:Dkf|Donal Fellows]] 13:16, 13 September 2012 (UTC)
I attempted to follow the verification example above. I started with the C code, made some modifications to get the intermediate results in the example, and was able to reproduce the the first 32 bit part of the result. The instructions for producing the second part are obscure though, and I was unable to reproduce the rest of the result in the example. Can these instructions be clarified? —[[User:Sonia|Sonia]] 19:09, 20 September 2012 (UTC)
| |||