A FAST ENCRYPTION SCHEME FOR NETWORKS APPLICATIONS

Mohamed Abo El-Fotouh, Klaus Diepold

2008

Abstract

In this paper we studied the two widely used encryption schemes to perform symmetric encryption for a huge number of concurrent clients in high-speed networks applications. The current schemes consume either plenty of memory to gain high throughput or low memory with low throughput. The need has aroused for a scheme that has low memory requirements and in the same time possesses high speed, as the number of the internet users increases each day. We used the SSM model (El-Fotouh and Diepold, 2008), to construct an encryption scheme based on the AES. The proposed scheme possesses high throughput together with low memory requirements. We performed theoretical and practical analyses for the existing and proposed schemes.

Paper Citation

in Harvard Style

Abo El-Fotouh M. and Diepold K. (2008). A FAST ENCRYPTION SCHEME FOR NETWORKS APPLICATIONS . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008) ISBN 978-989-8111-59-3, pages 119-127. DOI: 10.5220/0001919101190127

in Bibtex Style

@conference{secrypt08,
author={Mohamed Abo El-Fotouh and Klaus Diepold},
title={A FAST ENCRYPTION SCHEME FOR NETWORKS APPLICATIONS},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008)},
year={2008},
pages={119-127},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001919101190127},
isbn={978-989-8111-59-3},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2008)
TI - A FAST ENCRYPTION SCHEME FOR NETWORKS APPLICATIONS
SN - 978-989-8111-59-3
AU - Abo El-Fotouh M.
AU - Diepold K.
PY - 2008
SP - 119
EP - 127
DO - 10.5220/0001919101190127