Applications of tripled chaotic maps in cryptography
Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robust...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2007-05 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Behnia, Sohrab Akhshani, Afshin Akhavan, Amir Mahmodi, Hadi |
description | Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and experimental results state that the proposed algorithm has many capabilities such as acceptable speed and complexity in the algorithm due to the existence of two coupling parameter and high security. Note that the ciphertext has a flat distribution and has the same size as the plaintext. Therefore, it is suitable for practical use in secure communications. |
doi_str_mv | 10.48550/arxiv.0705.2633 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0705_2633</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2087512080</sourcerecordid><originalsourceid>FETCH-LOGICAL-a510-2bbb4e8dc4d8daf4d2c19426964af1d1fc91f65dbf548db6f09133355dac309c3</originalsourceid><addsrcrecordid>eNotjztrwzAYRUWh0JBm71QEne1-eloeQ-gLAl2yG1myGgXHUiWn1P--TpPl3uVwuQehBwIlV0LAs06__qeECkRJJWM3aEEZI4XilN6hVc4HAKCyokKwBeLrGHtv9OjDkHFweEw-9p3FZq_D6A0-6pixH7BJUxzDV9JxP92jW6f73K2uvUS715fd5r3Yfr59bNbbQgsCBW3blnfKGm6V1Y5bakjNqawl145Y4kxNnBS2dYIr20oHNWGMCWG1YVAbtkSPl9l_oyYmf9Rpas5mzdlsBp4uQEzh-9TlsTmEUxrmSw0FVQkyJ7A_ajhQ4A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2087512080</pqid></control><display><type>article</type><title>Applications of tripled chaotic maps in cryptography</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Behnia, Sohrab ; Akhshani, Afshin ; Akhavan, Amir ; Mahmodi, Hadi</creator><creatorcontrib>Behnia, Sohrab ; Akhshani, Afshin ; Akhavan, Amir ; Mahmodi, Hadi</creatorcontrib><description>Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and experimental results state that the proposed algorithm has many capabilities such as acceptable speed and complexity in the algorithm due to the existence of two coupling parameter and high security. Note that the ciphertext has a flat distribution and has the same size as the plaintext. Therefore, it is suitable for practical use in secure communications.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0705.2633</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Complexity ; Coupling ; Cryptography ; Cybersecurity ; Digital imaging ; Encryption ; Multimedia ; Parameters ; Physics - Chaotic Dynamics</subject><ispartof>arXiv.org, 2007-05</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/0705.2633.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,782,786,887,27934</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.0705.2633$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1016/j.chaos.2007.08.013$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Behnia, Sohrab</creatorcontrib><creatorcontrib>Akhshani, Afshin</creatorcontrib><creatorcontrib>Akhavan, Amir</creatorcontrib><creatorcontrib>Mahmodi, Hadi</creatorcontrib><title>Applications of tripled chaotic maps in cryptography</title><title>arXiv.org</title><description>Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and experimental results state that the proposed algorithm has many capabilities such as acceptable speed and complexity in the algorithm due to the existence of two coupling parameter and high security. Note that the ciphertext has a flat distribution and has the same size as the plaintext. Therefore, it is suitable for practical use in secure communications.</description><subject>Algorithms</subject><subject>Complexity</subject><subject>Coupling</subject><subject>Cryptography</subject><subject>Cybersecurity</subject><subject>Digital imaging</subject><subject>Encryption</subject><subject>Multimedia</subject><subject>Parameters</subject><subject>Physics - Chaotic Dynamics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotjztrwzAYRUWh0JBm71QEne1-eloeQ-gLAl2yG1myGgXHUiWn1P--TpPl3uVwuQehBwIlV0LAs06__qeECkRJJWM3aEEZI4XilN6hVc4HAKCyokKwBeLrGHtv9OjDkHFweEw-9p3FZq_D6A0-6pixH7BJUxzDV9JxP92jW6f73K2uvUS715fd5r3Yfr59bNbbQgsCBW3blnfKGm6V1Y5bakjNqawl145Y4kxNnBS2dYIr20oHNWGMCWG1YVAbtkSPl9l_oyYmf9Rpas5mzdlsBp4uQEzh-9TlsTmEUxrmSw0FVQkyJ7A_ajhQ4A</recordid><startdate>20070518</startdate><enddate>20070518</enddate><creator>Behnia, Sohrab</creator><creator>Akhshani, Afshin</creator><creator>Akhavan, Amir</creator><creator>Mahmodi, Hadi</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20070518</creationdate><title>Applications of tripled chaotic maps in cryptography</title><author>Behnia, Sohrab ; Akhshani, Afshin ; Akhavan, Amir ; Mahmodi, Hadi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a510-2bbb4e8dc4d8daf4d2c19426964af1d1fc91f65dbf548db6f09133355dac309c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Complexity</topic><topic>Coupling</topic><topic>Cryptography</topic><topic>Cybersecurity</topic><topic>Digital imaging</topic><topic>Encryption</topic><topic>Multimedia</topic><topic>Parameters</topic><topic>Physics - Chaotic Dynamics</topic><toplevel>online_resources</toplevel><creatorcontrib>Behnia, Sohrab</creatorcontrib><creatorcontrib>Akhshani, Afshin</creatorcontrib><creatorcontrib>Akhavan, Amir</creatorcontrib><creatorcontrib>Mahmodi, Hadi</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>Proquest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Behnia, Sohrab</au><au>Akhshani, Afshin</au><au>Akhavan, Amir</au><au>Mahmodi, Hadi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Applications of tripled chaotic maps in cryptography</atitle><jtitle>arXiv.org</jtitle><date>2007-05-18</date><risdate>2007</risdate><eissn>2331-8422</eissn><abstract>Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity of the cryptosystem, make a contribution to the development of cryptosystem with higher security. In order to increase the security of the proposed algorithm, the size of key space and the computational complexity of the coupling parameters should be increased as well. Both the theoretical and experimental results state that the proposed algorithm has many capabilities such as acceptable speed and complexity in the algorithm due to the existence of two coupling parameter and high security. Note that the ciphertext has a flat distribution and has the same size as the plaintext. Therefore, it is suitable for practical use in secure communications.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0705.2633</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2007-05 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_0705_2633 |
source | arXiv.org; Free E- Journals |
subjects | Algorithms Complexity Coupling Cryptography Cybersecurity Digital imaging Encryption Multimedia Parameters Physics - Chaotic Dynamics |
title | Applications of tripled chaotic maps in cryptography |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-02T06%3A41%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Applications%20of%20tripled%20chaotic%20maps%20in%20cryptography&rft.jtitle=arXiv.org&rft.au=Behnia,%20Sohrab&rft.date=2007-05-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0705.2633&rft_dat=%3Cproquest_arxiv%3E2087512080%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2087512080&rft_id=info:pmid/&rfr_iscdi=true |