Radial basis function networks as chaotic generators for secure communication systems

S. Papadimitriou, A. Bezerianos, T. Bountis

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

This paper improves upon a new class of discrete chaotic systems (i.e. chaotic maps) recently introduced for effective information encryption. The nonlinearity and adaptability of these systems are achieved by designing proper radial basis function networks. The potential for automatic synchronization, the lack of periodicity and the extremely large parameter spaces of these chaotic maps offer robust transmission security. The Radial Basis Function (RBF) networks offer a large number of parameters (i.e. the centers and spreads of the RBF kernels and the weights of the linear layer) while at the same time as universal approximators they have the flexibility to implement any function. The RBF networks can learn the dynamics of chaotic systems (maps or flows) and mimic them accurately by using many more parameters than the original dynamical recurrence. Since the parameter space size increases exponentially with respect to the number of parameters, the RBF based systems greatly outperform previous designs in terms of encryption security. Moreover, the learning of the dynamics from data generated by chaotic systems guarantees the chaoticity of the dynamics of the RBF networks and offers a convenient method of implementing any desirable chaotic dynamics. Since each sequence of training data gives rise to a distinct RBF configuration, theoretically there exists an infinity of possible configurations.

Original languageEnglish
Pages (from-to)221-232
Number of pages12
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume9
Issue number1
Publication statusPublished - Jan 1999
Externally publishedYes

Fingerprint

Radial basis function networks
Radial Basis Function Network
Secure Communication
Communication Systems
Chaotic systems
Communication systems
Radial Functions
Generator
Chaotic System
Basis Functions
Chaotic Map
Encryption
Cryptography
Parameter Space
Configuration
Chaotic Dynamics
Adaptability
Discrete Systems
Recurrence
Periodicity

ASJC Scopus subject areas

  • General
  • Applied Mathematics

Cite this

Radial basis function networks as chaotic generators for secure communication systems. / Papadimitriou, S.; Bezerianos, A.; Bountis, T.

In: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, Vol. 9, No. 1, 01.1999, p. 221-232.

Research output: Contribution to journalArticle

@article{a660da4dc2964c1c87c78ce72fc21647,
title = "Radial basis function networks as chaotic generators for secure communication systems",
abstract = "This paper improves upon a new class of discrete chaotic systems (i.e. chaotic maps) recently introduced for effective information encryption. The nonlinearity and adaptability of these systems are achieved by designing proper radial basis function networks. The potential for automatic synchronization, the lack of periodicity and the extremely large parameter spaces of these chaotic maps offer robust transmission security. The Radial Basis Function (RBF) networks offer a large number of parameters (i.e. the centers and spreads of the RBF kernels and the weights of the linear layer) while at the same time as universal approximators they have the flexibility to implement any function. The RBF networks can learn the dynamics of chaotic systems (maps or flows) and mimic them accurately by using many more parameters than the original dynamical recurrence. Since the parameter space size increases exponentially with respect to the number of parameters, the RBF based systems greatly outperform previous designs in terms of encryption security. Moreover, the learning of the dynamics from data generated by chaotic systems guarantees the chaoticity of the dynamics of the RBF networks and offers a convenient method of implementing any desirable chaotic dynamics. Since each sequence of training data gives rise to a distinct RBF configuration, theoretically there exists an infinity of possible configurations.",
author = "S. Papadimitriou and A. Bezerianos and T. Bountis",
year = "1999",
month = "1",
language = "English",
volume = "9",
pages = "221--232",
journal = "International Journal of Bifurcation and Chaos in Applied Sciences and Engineering",
issn = "0218-1274",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - Radial basis function networks as chaotic generators for secure communication systems

AU - Papadimitriou, S.

AU - Bezerianos, A.

AU - Bountis, T.

PY - 1999/1

Y1 - 1999/1

N2 - This paper improves upon a new class of discrete chaotic systems (i.e. chaotic maps) recently introduced for effective information encryption. The nonlinearity and adaptability of these systems are achieved by designing proper radial basis function networks. The potential for automatic synchronization, the lack of periodicity and the extremely large parameter spaces of these chaotic maps offer robust transmission security. The Radial Basis Function (RBF) networks offer a large number of parameters (i.e. the centers and spreads of the RBF kernels and the weights of the linear layer) while at the same time as universal approximators they have the flexibility to implement any function. The RBF networks can learn the dynamics of chaotic systems (maps or flows) and mimic them accurately by using many more parameters than the original dynamical recurrence. Since the parameter space size increases exponentially with respect to the number of parameters, the RBF based systems greatly outperform previous designs in terms of encryption security. Moreover, the learning of the dynamics from data generated by chaotic systems guarantees the chaoticity of the dynamics of the RBF networks and offers a convenient method of implementing any desirable chaotic dynamics. Since each sequence of training data gives rise to a distinct RBF configuration, theoretically there exists an infinity of possible configurations.

AB - This paper improves upon a new class of discrete chaotic systems (i.e. chaotic maps) recently introduced for effective information encryption. The nonlinearity and adaptability of these systems are achieved by designing proper radial basis function networks. The potential for automatic synchronization, the lack of periodicity and the extremely large parameter spaces of these chaotic maps offer robust transmission security. The Radial Basis Function (RBF) networks offer a large number of parameters (i.e. the centers and spreads of the RBF kernels and the weights of the linear layer) while at the same time as universal approximators they have the flexibility to implement any function. The RBF networks can learn the dynamics of chaotic systems (maps or flows) and mimic them accurately by using many more parameters than the original dynamical recurrence. Since the parameter space size increases exponentially with respect to the number of parameters, the RBF based systems greatly outperform previous designs in terms of encryption security. Moreover, the learning of the dynamics from data generated by chaotic systems guarantees the chaoticity of the dynamics of the RBF networks and offers a convenient method of implementing any desirable chaotic dynamics. Since each sequence of training data gives rise to a distinct RBF configuration, theoretically there exists an infinity of possible configurations.

UR - http://www.scopus.com/inward/record.url?scp=0032622837&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032622837&partnerID=8YFLogxK

M3 - Article

VL - 9

SP - 221

EP - 232

JO - International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

JF - International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

SN - 0218-1274

IS - 1

ER -