Hyper Coupled Map Lattices for Hiding Multiple Images

The concept of a hyper coupled map lattice (CML) is presented in this paper. The complexity of the lattice is increased not by adding another spatial dimension of the lattice but by replacing scalar nodal variables by multidimensional square matrices of iterative variables. The proposed scheme explo...

Full description

Saved in:
Bibliographic Details
Published in:Complexity (New York, N.Y.) N.Y.), 2023, Vol.2023, p.1-20
Main Authors: Smidtaite, Rasa, Ragulskiene, Jurate, Bikulciene, Liepa, Ragulskis, Minvydas
Format: Article
Language:English
Subjects:
Algorithms
Carrying capacity
Cryptography
Data encryption
Digital imaging
Eigenvalues
Iterative methods
Lattices
Mapping
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43
cites cdi_FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43
container_end_page 20
container_issue
container_start_page 1
container_title Complexity (New York, N.Y.)
container_volume 2023
creator Smidtaite, Rasa
Ragulskiene, Jurate
Bikulciene, Liepa
Ragulskis, Minvydas
description The concept of a hyper coupled map lattice (CML) is presented in this paper. The complexity of the lattice is increased not by adding another spatial dimension of the lattice but by replacing scalar nodal variables by multidimensional square matrices of iterative variables. The proposed scheme exploits the nonlinear effects of the spatiotemporal divergence induced by nilpotent nodal matrices to generate separate secret images at different discrete moments of time during the evolution of the CML. The time variable plays the primary role in the decoding stage of the scheme. The carrying capacity of the proposed scheme is n−1 different dichotomous digital images, where n is the dimension of the nilpotent nodal matrices. Computational experiments are used to demonstrate the efficacy of the proposed scheme.
doi_str_mv 10.1155/2023/8831078
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_1692abff64314d128550db4619d2bd1f</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_1692abff64314d128550db4619d2bd1f</doaj_id><sourcerecordid>2846832417</sourcerecordid><originalsourceid>FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43</originalsourceid><addsrcrecordid>eNp9kM1OwzAQhC0EEqVw4wEicYRQr-3YzhFVQCu14gJny46d4iqtg5MI9e1xScWR0_7o29nRIHQL-BGgKGYEEzqTkgIW8gxNAJdljgvCz4-94DkRUlyiq67bYoxLTsUEFYtD62I2D0PbOJutdZutdN_7ynVZHWK28NbvN9l6aHqfiGy50xvXXaOLWjeduznVKfp4eX6fL_LV2-ty_rTKK4Zpn9sSC2aw0RU2BJIxC1DpwnIjSnBSEE1YZTglTLBCU5euZJoMxzV3YBmdouWoa4Peqjb6nY4HFbRXv4sQN0rHZLZxCnhJtKlrzigwC0QWBbaGcSgtMRbqpHU3arUxfA2u69U2DHGf7CsiGZfJBYhEPYxUFUPXRVf_fQWsjiGrY8jqFHLC70f80--t_vb_0z81a3hS</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2846832417</pqid></control><display><type>article</type><title>Hyper Coupled Map Lattices for Hiding Multiple Images</title><source>Wiley Open Access</source><creator>Smidtaite, Rasa ; Ragulskiene, Jurate ; Bikulciene, Liepa ; Ragulskis, Minvydas</creator><contributor>Munoz-Pacheco, Jesus M. ; Jesus M Munoz-Pacheco</contributor><creatorcontrib>Smidtaite, Rasa ; Ragulskiene, Jurate ; Bikulciene, Liepa ; Ragulskis, Minvydas ; Munoz-Pacheco, Jesus M. ; Jesus M Munoz-Pacheco</creatorcontrib><description>The concept of a hyper coupled map lattice (CML) is presented in this paper. The complexity of the lattice is increased not by adding another spatial dimension of the lattice but by replacing scalar nodal variables by multidimensional square matrices of iterative variables. The proposed scheme exploits the nonlinear effects of the spatiotemporal divergence induced by nilpotent nodal matrices to generate separate secret images at different discrete moments of time during the evolution of the CML. The time variable plays the primary role in the decoding stage of the scheme. The carrying capacity of the proposed scheme is n−1 different dichotomous digital images, where n is the dimension of the nilpotent nodal matrices. Computational experiments are used to demonstrate the efficacy of the proposed scheme.</description><identifier>ISSN: 1076-2787</identifier><identifier>EISSN: 1099-0526</identifier><identifier>DOI: 10.1155/2023/8831078</identifier><language>eng</language><publisher>Hoboken: Hindawi</publisher><subject>Algorithms ; Carrying capacity ; Cryptography ; Data encryption ; Digital imaging ; Eigenvalues ; Iterative methods ; Lattices ; Mapping</subject><ispartof>Complexity (New York, N.Y.), 2023, Vol.2023, p.1-20</ispartof><rights>Copyright © 2023 Rasa Smidtaite et al.</rights><rights>Copyright © 2023 Rasa Smidtaite et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43</citedby><cites>FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43</cites><orcidid>0000-0002-3348-9717 ; 0000-0002-3101-6967 ; 0000-0002-0005-8240</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><contributor>Munoz-Pacheco, Jesus M.</contributor><contributor>Jesus M Munoz-Pacheco</contributor><creatorcontrib>Smidtaite, Rasa</creatorcontrib><creatorcontrib>Ragulskiene, Jurate</creatorcontrib><creatorcontrib>Bikulciene, Liepa</creatorcontrib><creatorcontrib>Ragulskis, Minvydas</creatorcontrib><title>Hyper Coupled Map Lattices for Hiding Multiple Images</title><title>Complexity (New York, N.Y.)</title><description>The concept of a hyper coupled map lattice (CML) is presented in this paper. The complexity of the lattice is increased not by adding another spatial dimension of the lattice but by replacing scalar nodal variables by multidimensional square matrices of iterative variables. The proposed scheme exploits the nonlinear effects of the spatiotemporal divergence induced by nilpotent nodal matrices to generate separate secret images at different discrete moments of time during the evolution of the CML. The time variable plays the primary role in the decoding stage of the scheme. The carrying capacity of the proposed scheme is n−1 different dichotomous digital images, where n is the dimension of the nilpotent nodal matrices. Computational experiments are used to demonstrate the efficacy of the proposed scheme.</description><subject>Algorithms</subject><subject>Carrying capacity</subject><subject>Cryptography</subject><subject>Data encryption</subject><subject>Digital imaging</subject><subject>Eigenvalues</subject><subject>Iterative methods</subject><subject>Lattices</subject><subject>Mapping</subject><issn>1076-2787</issn><issn>1099-0526</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNp9kM1OwzAQhC0EEqVw4wEicYRQr-3YzhFVQCu14gJny46d4iqtg5MI9e1xScWR0_7o29nRIHQL-BGgKGYEEzqTkgIW8gxNAJdljgvCz4-94DkRUlyiq67bYoxLTsUEFYtD62I2D0PbOJutdZutdN_7ynVZHWK28NbvN9l6aHqfiGy50xvXXaOLWjeduznVKfp4eX6fL_LV2-ty_rTKK4Zpn9sSC2aw0RU2BJIxC1DpwnIjSnBSEE1YZTglTLBCU5euZJoMxzV3YBmdouWoa4Peqjb6nY4HFbRXv4sQN0rHZLZxCnhJtKlrzigwC0QWBbaGcSgtMRbqpHU3arUxfA2u69U2DHGf7CsiGZfJBYhEPYxUFUPXRVf_fQWsjiGrY8jqFHLC70f80--t_vb_0z81a3hS</recordid><startdate>2023</startdate><enddate>2023</enddate><creator>Smidtaite, Rasa</creator><creator>Ragulskiene, Jurate</creator><creator>Bikulciene, Liepa</creator><creator>Ragulskis, Minvydas</creator><general>Hindawi</general><general>Hindawi Limited</general><general>Hindawi-Wiley</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7XB</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-3348-9717</orcidid><orcidid>https://orcid.org/0000-0002-3101-6967</orcidid><orcidid>https://orcid.org/0000-0002-0005-8240</orcidid></search><sort><creationdate>2023</creationdate><title>Hyper Coupled Map Lattices for Hiding Multiple Images</title><author>Smidtaite, Rasa ; Ragulskiene, Jurate ; Bikulciene, Liepa ; Ragulskis, Minvydas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Carrying capacity</topic><topic>Cryptography</topic><topic>Data encryption</topic><topic>Digital imaging</topic><topic>Eigenvalues</topic><topic>Iterative methods</topic><topic>Lattices</topic><topic>Mapping</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Smidtaite, Rasa</creatorcontrib><creatorcontrib>Ragulskiene, Jurate</creatorcontrib><creatorcontrib>Bikulciene, Liepa</creatorcontrib><creatorcontrib>Ragulskis, Minvydas</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest research library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</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 Basic</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Complexity (New York, N.Y.)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Smidtaite, Rasa</au><au>Ragulskiene, Jurate</au><au>Bikulciene, Liepa</au><au>Ragulskis, Minvydas</au><au>Munoz-Pacheco, Jesus M.</au><au>Jesus M Munoz-Pacheco</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hyper Coupled Map Lattices for Hiding Multiple Images</atitle><jtitle>Complexity (New York, N.Y.)</jtitle><date>2023</date><risdate>2023</risdate><volume>2023</volume><spage>1</spage><epage>20</epage><pages>1-20</pages><issn>1076-2787</issn><eissn>1099-0526</eissn><abstract>The concept of a hyper coupled map lattice (CML) is presented in this paper. The complexity of the lattice is increased not by adding another spatial dimension of the lattice but by replacing scalar nodal variables by multidimensional square matrices of iterative variables. The proposed scheme exploits the nonlinear effects of the spatiotemporal divergence induced by nilpotent nodal matrices to generate separate secret images at different discrete moments of time during the evolution of the CML. The time variable plays the primary role in the decoding stage of the scheme. The carrying capacity of the proposed scheme is n−1 different dichotomous digital images, where n is the dimension of the nilpotent nodal matrices. Computational experiments are used to demonstrate the efficacy of the proposed scheme.</abstract><cop>Hoboken</cop><pub>Hindawi</pub><doi>10.1155/2023/8831078</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0002-3348-9717</orcidid><orcidid>https://orcid.org/0000-0002-3101-6967</orcidid><orcidid>https://orcid.org/0000-0002-0005-8240</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1076-2787
ispartof Complexity (New York, N.Y.), 2023, Vol.2023, p.1-20
issn 1076-2787
1099-0526
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_1692abff64314d128550db4619d2bd1f
source Wiley Open Access
subjects Algorithms
Carrying capacity
Cryptography
Data encryption
Digital imaging
Eigenvalues
Iterative methods
Lattices
Mapping
title Hyper Coupled Map Lattices for Hiding Multiple Images
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T00%3A15%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hyper%20Coupled%20Map%20Lattices%20for%20Hiding%20Multiple%20Images&rft.jtitle=Complexity%20(New%20York,%20N.Y.)&rft.au=Smidtaite,%20Rasa&rft.date=2023&rft.volume=2023&rft.spage=1&rft.epage=20&rft.pages=1-20&rft.issn=1076-2787&rft.eissn=1099-0526&rft_id=info:doi/10.1155/2023/8831078&rft_dat=%3Cproquest_doaj_%3E2846832417%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c403t-d9074b0bac0b21883d11ca5d6b791e872a24cb6324745a3ec408632b60f6e1d43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2846832417&rft_id=info:pmid/&rfr_iscdi=true