Marc Davio, Yvo Desmedt, Marc Fosseprez, Rene Govaerts, Jan Hulsbosch, trik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, and Pascal Wouters. Analytical characteristics of the DES. In Proceedings of Crypro '83, pages 171-202, August 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The IP 1 lookup is also done 4 bits at e[ time. The version timed below has prese[lting, but the original version did in line salting only. However, the code is well written and it runs quickly. The implementations by both Baldwin and Bishop use e[ transformation of DES de scribed by Dewio[3]. The recurrence equation is rewritten so that the E expansion is combined with the S function and the P permutation; thus, only e[ single lookup table is needed for the DES rounds. An e 1 function is needed at the end of the 25 DES encryptions, but this can be combined with the IP 1 table. The ....

Marc Davio, Yvo Desmedt, Marc Fosseprez, Rene Govaerts, Jan Hulsbosch, trik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, and Pascal Wouters. Analytical characteristics of the DES. In Proceedings of Crypro '83, pages 171-202, August 1983.

....shift operations and therefore, the authors did not see more than a 10 improvement in the total execution time. However, in the DSP the improvement was manyfold. The other major algorithm described in the paper was DES. In implementing DES, Dusse and Kaliski, followed the paper by Davio et al. [6]. The authors pointed out that one of the di#culties in implementing DES is the expense of applying the expansion function E and the permutation function P . However, one way of getting around this problem is by modifying the S boxes to incorporate the permutation P and the mapping E. The ....

M. Davio, Y. Desmedt, M. Fosseprez, R. Govaerts, J. Hulsbosch, P. Neutjens, P. Piret, J.-J. Quisquater, J. Vandewalle, and P. Wouters. Analytical characteristics of the DES. In D. Chaum, editor, Advances in Cryptology -- Crypto '83, pages 171--202. Plenum Press, 1984.

....Keys can be computed either the standard way or with a permutation per subkey. The SPE lookups can be done 6 or 12 bits at a time. It is also sophisticated about taking advantage of the machine architecture to improve its speed. His implementation uses a transformation of DES described by Davio[2]. The recurrence equation is rewritten so the the E expansion is combined with the S function and the P permutation; thus, only a single lookup table is needed for the DES rounds. An E expansion (ffl) must be combined with the IP table. An E expansion inverse (ffl Gamma1 ) is needed at the end ....

....is twice the speed of the speed des implementation presented in this paper. However, it is difficult to evaluate the validity of this claim from the paper. In particular, the speed seems inconsistent with an implementation that uses the DES transformations suggested by Davio in a previous paper[2]. Phil Karn also did a fast implementation of DES[5] Karn s subkey generation is identical to that is speed des, for the good reason that speed des borrowed the code from his implementation. His implementation combines the S and P lookups into a single table that requires eight 6 bit lookups. ....

Marc Davio, Yvo Desmedt, Marc Fosseprez, Rene Govaerts, Jan Hulsbosch, Patrik Neutjens, Joos Vandewalle, and Pascal Wouters, "Analytical characteristics of the DES", In Proceedings of Crypto '83, pages 171--202, August 1983.

No context found.

Marc Davio, Yvo Desmedt, Marc Fosseprez, Rene Govaerts, Jan Hulsbosch, Patrik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, and Pascal Wouters. Analytical characteristics of the DES. In Proceedings of Crypto '83, pages 171--202, August 1983.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC