文摘
In this paper, we propose a 128-bit Feistel square cryptosystem, which all the while captivates key-subordinate S-box and key-subordinate P-box. With these two key-subordinate changes, the inside structure of this cryptosystem calculation is secured, in order to oppose the direct and differential cryptanalysis in a couple round encryptions. Thus, the encryption what’s more decoding capacities are very proficient. We named this key-ward structure the DSDP structure, and the cryptosystem DSDP. A quick change calculation is utilized to create both the key-subordinate S-box and key-subordinate P-boxes. This enormously repays the execution penalty of complex key plan. The essential operations utilized as a part of DSDP are all proficient byte wise operations, so the calculation will have a sensible quick speed on late processors, 16-bit processors and shrewd cards and in addition 8-bit processors. We execute the calculation with C what’s more Java separately on a few PCs with diverse processors, what’s more gauge the upgraded get together execution on Pentium. The exploratory results and the estimation demonstrates that DSDP has a quick encryption/unscrambling rate and a sensible quick key planning execution.