kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Chaos-based Pseudo Random Number Generators via quasi-synchronized Chua’s circuits: a symmetric encryption perspective
Department of Physics and Astronomy, University of Padua, Padua, Italy.
Department of Physics and Astronomy, University of Bologna, Bologna, Italy.
Department of Computing Science, University of Alberta, Edmonton, AB, Canada.
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA.
Show others and affiliations
2026 (English)In: Analog Integrated Circuits and Signal Processing, ISSN 0925-1030, E-ISSN 1573-1979, Vol. 126, no 2, article id 26Article in journal (Refereed) Published
Abstract [en]

Research efforts have extensively shown the significant roles of unpredictable phenomena originated in nature, such as chaos, as an inspiring discipline to generate random numbers. In the current study, focusing on encryption purposes, the main strategy is to provide a keystream using Pseudo Random Number Generators (PRNGs) derived from synchronized chaotic systems. Numerous Investigations performed on the synchronized configuration of Chua’s circuit have proven the advantage of its application as a prominent chaotic system. However, the less than ideal alignment between the core objective of the research, that is offering a secure communication optionally necessitating an arbitrary distance of the correspondents, and the standard version of synchronized Chua’s circuits not fulfilling this condition pragmatically, made the authors tackle the problem analytically by using the governing equations of the circuits and creating the so-called quasi-synchronized condition between the receiving and the transmitting sides. At last, eight different mathematical schemes are designed to manipulate the numerical data provided by the Chua’s equations to generate binary sequences for encryption purposes and then the main attempt has been dedicated to the evaluation of the results and finding the optimal PRNGs by conventional standards in cryptography provided by National Institute of Standards and Technology. Finally, three of the designed schemes are chosen as the successful methods, passing randomness criteria.

Place, publisher, year, edition, pages
2026. Vol. 126, no 2, article id 26
Keywords [en]
Chaos theory, Chaotic circuits/hardware, Chua’s circuit, Key agreement, Pseudo/true random number generator, Stream cipher, Symmetric encryption
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-375752DOI: 10.1007/s10470-025-02542-6ISI: 001649163000003Scopus ID: 2-s2.0-105026320839OAI: oai:DiVA.org:kth-375752DiVA, id: diva2:2031049
Note

QC 20260122

Available from: 2026-01-22 Created: 2026-01-22 Last updated: 2026-01-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Amini, Kasra

Search in DiVA

By author/editor
Amini, Kasra
By organisation
Fluid Mechanics
In the same journal
Analog Integrated Circuits and Signal Processing
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf