Title
New class of the FPGA efficient cryptographic primitives
Abstract
This work focuses the problem of further development of the approach to the fast cipher design, based on data-dependent (DD) permutations (DDP). A new class of the DDP-like operations is described. New DD operations (DDO) are constructed replacing the switching element in the DDP boxes by different controlled elements (CE) having the same size. Full classification of CE with two non-linear outputs is presented. Two subclasses of nonlinear CE, with the best differential characteristics are recommended for the use in the non-linear DDO-boxes synthesis. The non-linear CE boxes are implemented in FPGA modules using the same hardware resources as switching elements. It is shown that the use of the nonlinear DDO, instead of DDP allows one to reduce the number of rounds. With this technique higher Performance/Cost ratio is achieved, while designing fast hardware suitable ciphers.
Year
DOI
Venue
2004
10.1109/ISCAS.2004.1329331
Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium
Keywords
Field
DocType
cryptography,field programmable gate arrays,FPGA,cryptography,data dependent operation,data dependent permutation boxes,fast block cipher design,field programmable gate array,nonlinear controlled element,switching element
Boolean function,Cipher,Nonlinear system,Cryptography,Computer science,Permutation,Field-programmable gate array,Electronic engineering,Cryptographic primitive,Information engineering
Conference
Volume
ISBN
Citations 
2
0-7803-8251-X
0
PageRank 
References 
Authors
0.34
4
4
Name
Order
Citations
PageRank
Nick A. Moldovyan100.34
Eremeev, M.A.200.34
N. Sklavos316523.32
O. Koufopavlou425628.43