The Experts below are selected from a list of 48 Experts worldwide ranked by ideXlab platform
A M Elshafee - One of the best experts on this subject based on the ideXlab platform.
-
dynamically key controlled symmetric block cipher kamfee
National Radio Science Conference, 2003Co-Authors: H M Elkamchouchi, A M ElshafeeAbstract:This paper gives a new symmetric cryptosystem having a key dependent block length and key dependent rounds, enhanced by a rotor. The number of rotor's wheels depends on key length too, rotor is implemented using successive eight bits affine transformation. Its block is divided into basic blocks of thirty-two bits length. 2/sup 32/ Modulo Addition and thirty-two bits XORING are used. It uses thirty-two bits s-boxes implemented using thirty-two affine transformation. Two steps of permutation are used, first step is basic block permutation and second step is basic block mixing. The strength of this system is compared with the well-known DES, GOST, BLOW FISH, IDEA, RC5 and RIJNDAEL and gives excellent results from the point of view of security characteristics and the statistics of the ciphertext. So authors suggest using KAMFEE in the area of banking and electronic fund transfer.
-
dynamically key controlled symmetric block cipher kamfee march 18 20 2003 cairo egypt
2003Co-Authors: A M ElshafeeAbstract:This paper gives, a new symmetric cryptmystem having a key dependent block length and key dependent rounds, enhanced by a rotor. The number of rotor’s wheels depends on key length tw, rotor is implemented using suooessive eight bits affine transfonoations. Its block is divided into basic blocks of thirtytwo bits la& Z3’ Modulo Addition and Thuty-two bits XORING are used. It uses fhixty-two bits s-boxes implemented using thuty-two bits atfine transformation. Two steps of permutation are used, first step is basic block permutation and second step is basic block mixing. The strength of this system is compared with the well-kum DES, GOST. BLOW FISH, IDEA, RC5 and RIJNDAEL and gives excellent results from the point of view of dty characteristics and the statistics of the ciphertext. So authors suggests to use KAMFEE in the area of banking and electronic fund transfer. L INTRODUCTION In these days of Internet [I], Id area networks (LANs), cellular phones and satellite communication& both computer network security and information mrity issues are on rise. More and mre people are conununicahng with each other through these new media and more people are getting concemed about Senuity of the information they deal with in any of these communication media Cryptology is the science that deals with information security. It comprises both of cryptography, which is the science, concemed with how to protect information and Cryptanalysis which is the science concemed with how to nnsecure information that is thought to be protected and sawed by clyptographic means. Thus, cryptology is an active science that is in continuous study and big challenges. It always seeks to overwhelm the increasing computer sped There are two types of nyptosrstems symmetric and asymmetric. In symmetric cryptosysteq the encryption prows consists of an algorithm and a key. For given plaintext, the encryption algorithm gives its output depending on the key used. The ciphertext is hansmitted through the communication channel towards destination At the receiver the decryption algorithm uses the same key to convert ciphertext into plaintext again. Encrypion is expressed by the mathematical expression:
H M Elkamchouchi - One of the best experts on this subject based on the ideXlab platform.
-
dynamically key controlled symmetric block cipher kamfee
National Radio Science Conference, 2003Co-Authors: H M Elkamchouchi, A M ElshafeeAbstract:This paper gives a new symmetric cryptosystem having a key dependent block length and key dependent rounds, enhanced by a rotor. The number of rotor's wheels depends on key length too, rotor is implemented using successive eight bits affine transformation. Its block is divided into basic blocks of thirty-two bits length. 2/sup 32/ Modulo Addition and thirty-two bits XORING are used. It uses thirty-two bits s-boxes implemented using thirty-two affine transformation. Two steps of permutation are used, first step is basic block permutation and second step is basic block mixing. The strength of this system is compared with the well-known DES, GOST, BLOW FISH, IDEA, RC5 and RIJNDAEL and gives excellent results from the point of view of security characteristics and the statistics of the ciphertext. So authors suggest using KAMFEE in the area of banking and electronic fund transfer.
Ahmed El Shafee - One of the best experts on this subject based on the ideXlab platform.
-
A 64 bits Dynamically Key Controlled Symmetric Cipher (KAMFEE-X64)
2012Co-Authors: Ahmed El ShafeeAbstract:This paper presents an improved version of KAMFEE cipher [1]. The proposed cipher (KAMFEE-X64) is designed to be compatible with the new 64 bits microprocessors unlike the old cipher (KAMFEE) which is designed for systems based on x86 microprocessors. KAMFEE-X64 has a key dependent block length and key dependent rounds, enhanced by a rotor. The number of rotor’s wheels depends on key length too, rotor is implemented using successive 64 bits affine transformations. Its block is divided into basic blocks of 64 bits length. 264 Modulo Addition and 64 bits XORING are used. It uses 64 bits sboxes implemented using 64 bits affine transformation. Two steps of permutation are used, first step is basic block permutation and second step is basic block mixing. The strength of this system is compared with the KAMFEE and the well-known RC6, and RIJNDAEL ciphers. KAMFEE-X64 cipher gives excellent results from security characteristics and statistical point of view of. So authors suggests to use KAMFEE-X64 in the area of banking and electronic fund transfer.
Mikhail Selianinau - One of the best experts on this subject based on the ideXlab platform.
-
an efficient implementation of the chinese remainder theorem in minimally redundant residue number system
Computer Science, 2020Co-Authors: Mikhail SelianinauAbstract:The Chinese Remainder Theorem (CRT) widely used in many modern computer applications. This paper presents an efficient approach to the calculation of the rank of a number, a principal positional characteristic used in the Residue Number System (RNS). The proposed method does not use large Modulo Addition operations compared to a straightforward implementation of the CRT algorithm. The rank of a number is equal to a sum of an inexact rank and a two-valued correction factor that only takes on the values 0 or 1. We propose a minimally redundant RNS, which provides low computational complexity of the rank calculation. The effectiveness of the novel method is analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the extra residue Modulo 2, the complexity of rank calculation goes down from \(O(k^2)\) to \(O(k)\), where \(k\) equals the number of residues in non-redundant RNS.
Meir Feder - One of the best experts on this subject based on the ideXlab platform.
-
universal communication over Modulo additive individual noise sequence channels
International Symposium on Information Theory, 2011Co-Authors: Yuval Lomnitz, Meir FederAbstract:Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state compressibility of a sequence defined by Lempel and Ziv, we define a “capacity” for such a channel as the highest rate achievable by a designer knowing the particular relation that indeed exists between the input and output for all times, yet is constrained to use a fixed finite-length block communication scheme (i.e., use the same scheme over each block). In the case of the binary Modulo additive channel, where the output sequence is obtained by Modulo Addition of an unknown individual sequence to the input sequence, this capacity is upper bounded by 1 − ρ where ρ is the finite state compressibility of the noise sequence. We present a communication scheme with feedback that attains this rate universally without prior knowledge of the noise sequence.