In this paper, DES algorithm is implemented by applying pipelining concept to the key scheduling part. Using this implementation, it is possible to have the key length equal to data length; which further improves the security of the system, at the same time decaying the performance. This scenario is similar to that of one time pad. i.e, here key storage and transmission is going to occupy more area and power, degrading the performance of the system. The security vs performance trade off is analyzed for the circuit. Another solution is also introduced in this paper, i.e, the Linear Feedback Shift Registers(LFSRs). Using LFSR, it is possible to have different keys generated every clock cycles, improving the security of the system, at the same time we need to store or transmit the single seed of LFSR only. The design is implemented in Virtex 5 FPGA device using Xilinx 12.1 platform. An encryption rate of 35.5 gbits/S is obtained, which is almost the fastest among all other current implementations. The performance of the system in terms of area, power and timing is analyzed using the Synopsys tool. © 2012 Springer-Verlag.
cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@7509fd9d ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@62e98a72 Through org.apache.xalan.xsltc.dom.DOMAdapter@52807519; Conference Code:93237
P. Va Sruthi, Poornachandran, Pb, and Ajai, A. SaRemya, “Performance analysis and improvement using LFSR in the pipelined key scheduling section of DES”, Communications in Computer and Information Science, vol. 335 CCIS, pp. 215-224, 2012.