New random block cipher algorithm

Salah A. Albermany; Fatima Radi Hamade; Ghazanfar Safdar

doi:10.1109/CRCSIT.2017.7965555

New random block cipher algorithm

Salah A. Albermany
, Fatima Radi Hamade
, Ghazanfar Safdar

Institute for Research in Applicable Computing (IRAC)

University of Kufa

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

22 Citations (Scopus)

Abstract

This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function, bitwise operations and a carefully key schedule design. The new algorithm uses in protected wireless network and comparing with the old system (without encryption key), the proposed designs are designed for security purposes as characterized highly efficient encrypting large data. As for the analysis for the proposed block cipher design proves terms of privacy, data integrity, authentication and non-repudiation.

Original language	English
Title of host publication	nan
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	174-179
ISBN (Print)	9781538629550
DOIs	https://doi.org/10.1109/CRCSIT.2017.7965555
Publication status	Published - 3 Jul 2017
Event	2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT) - Slemani Duration: 26 Apr 2017 → 27 Apr 2017

Conference

Conference	2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT)
City	Slemani
Period	26/04/17 → 27/04/17
Other	2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT) (26/04/2017-27/04/2017, Slemani)

Keywords

Generalized Unbalanced Feistel structure
RADG Automata
block Cipher

Access to Document

10.1109/CRCSIT.2017.7965555

https://ieeexplore.ieee.org/document/7965555

Handle.net

Persistent link

Cite this

@inproceedings{239eaa5a0eb74e8ca1219d6f9e05af54,

title = "New random block cipher algorithm",

abstract = "This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function, bitwise operations and a carefully key schedule design. The new algorithm uses in protected wireless network and comparing with the old system (without encryption key), the proposed designs are designed for security purposes as characterized highly efficient encrypting large data. As for the analysis for the proposed block cipher design proves terms of privacy, data integrity, authentication and non-repudiation.",

keywords = "Generalized Unbalanced Feistel structure, RADG Automata, block Cipher",

author = "Albermany, \{Salah A.\} and Hamade, \{Fatima Radi\} and Ghazanfar Safdar",

year = "2017",

month = jul,

day = "3",

doi = "10.1109/CRCSIT.2017.7965555",

language = "English",

isbn = "9781538629550",

pages = "174--179",

booktitle = "nan",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT) ; Conference date: 26-04-2017 Through 27-04-2017",

}

TY - GEN

T1 - New random block cipher algorithm

AU - Albermany, Salah A.

AU - Hamade, Fatima Radi

AU - Safdar, Ghazanfar

PY - 2017/7/3

Y1 - 2017/7/3

N2 - This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function, bitwise operations and a carefully key schedule design. The new algorithm uses in protected wireless network and comparing with the old system (without encryption key), the proposed designs are designed for security purposes as characterized highly efficient encrypting large data. As for the analysis for the proposed block cipher design proves terms of privacy, data integrity, authentication and non-repudiation.

AB - This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function, bitwise operations and a carefully key schedule design. The new algorithm uses in protected wireless network and comparing with the old system (without encryption key), the proposed designs are designed for security purposes as characterized highly efficient encrypting large data. As for the analysis for the proposed block cipher design proves terms of privacy, data integrity, authentication and non-repudiation.

KW - Generalized Unbalanced Feistel structure

KW - RADG Automata

KW - block Cipher

U2 - 10.1109/CRCSIT.2017.7965555

DO - 10.1109/CRCSIT.2017.7965555

M3 - Conference contribution

SN - 9781538629550

SP - 174

EP - 179

BT - nan

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT)

Y2 - 26 April 2017 through 27 April 2017

ER -

New random block cipher algorithm

Abstract

Conference

Keywords

Access to Document

Handle.net

Fingerprint

Cite this