Log in

Relevant bibliographies by topics / Lorenz cipher system

Contents

Journal articles
Books
Book chapters
Conference papers

Academic literature on the topic 'Lorenz cipher system'

Author: Grafiati

Published: 4 June 2021

Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lorenz cipher system.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Lorenz cipher system"

1

Et al., Al-Bahrani. "A New Cipher Based on Feistel Structure and Chaotic Maps." Baghdad Science Journal 16, no. 1 (March 17, 2019): 0270. http://dx.doi.org/10.21123/bsj.16.1.(suppl.).0270.

Full text

Abstract:

Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static, While using chaotic maps, in the suggested system, called Chaotic-based Proposed Feistel Cipher System (CPFCS), we made the confusion and diffusion in dynamical behavior based on Standard and Lorenz maps. The first is used for substitution, and the second one for permutation operations .A proposed cryptographic system uses the same work (the same way) for both enciphering and deciphering. The proposed cipher operates on more than 500 bytes (4000-bit) readable text blocks by six round computing. Within the basic operator of the cipher, i.e., in the function of the round F, a dynamical lookup table 2D standard map system is used to enhance the complexity and diffusion of the unreadable text. Also, a 3D Logistic map used for key sequence generator and chaos based dynamical Initial Permutation (dynamical IP) are used to increase the diffusion and confusion. Three different image sizes and three different text length were implemented in CPFCS. The results of the proposed system and security tests improve the applicability of PFCS in the data protection and security.

APA, Harvard, Vancouver, ISO, and other styles

2

Et al., Al-Bahrani. "A New Cipher Based on Feistel Structure and Chaotic Maps." Baghdad Science Journal 16, no. 1(Suppl.) (March 17, 2019): 0270. http://dx.doi.org/10.21123/bsj.2019.16.1(suppl.).0270.

Full text

Abstract:

Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static, While using chaotic maps, in the suggested system, called Chaotic-based Proposed Feistel Cipher System (CPFCS), we made the confusion and diffusion in dynamical behavior based on Standard and Lorenz maps. The first is used for substitution, and the second one for permutation operations .A proposed cryptographic system uses the same work (the same way) for both enciphering and deciphering. The proposed cipher operates on more than 500 bytes (4000-bit) readable text blocks by six round computing. Within the basic operator of the cipher, i.e., in the function of the round F, a dynamical lookup table 2D standard map system is used to enhance the complexity and diffusion of the unreadable text. Also, a 3D Logistic map used for key sequence generator and chaos based dynamical Initial Permutation (dynamical IP) are used to increase the diffusion and confusion. Three different image sizes and three different text length were implemented in CPFCS. The results of the proposed system and security tests improve the applicability of PFCS in the data protection and security.

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Xiaoling, Guodong Ye, and Kwok-Wo Wong. "Chaotic Image Encryption Algorithm Based on Circulant Operation." Abstract and Applied Analysis 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/384067.

Full text

Abstract:

A novel chaotic image encryption scheme based on the time-delay Lorenz system is presented in this paper with the description of Circulant matrix. Making use of the chaotic sequence generated by the time-delay Lorenz system, the pixel permutation is carried out in diagonal and antidiagonal directions according to the first and second components. Then, a pseudorandom chaotic sequence is generated again from time-delay Lorenz system using all components. Modular operation is further employed for diffusion by blocks, in which the control parameter is generated depending on the plain-image. Numerical experiments show that the proposed scheme possesses the properties of a large key space to resist brute-force attack, sensitive dependence on secret keys, uniform distribution of gray values in the cipher-image, and zero correlation between two adjacent cipher-image pixels. Therefore, it can be adopted as an effective and fast image encryption algorithm.

APA, Harvard, Vancouver, ISO, and other styles

4

Hamood, Laith Abdulhussein, and Mahmood K. Ibrahem. "Secure Video Exchange System Based on Stream Cipher and Lorenz System." IARJSET 5, no. 9 (September 30, 2018): 30–36. http://dx.doi.org/10.17148/iarjset.2018.595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lin, Riguang, and Sheng Li. "An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm." Security and Communication Networks 2021 (April 20, 2021): 1–18. http://dx.doi.org/10.1155/2021/5586959.

Full text

Abstract:

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.

APA, Harvard, Vancouver, ISO, and other styles

6

Ren, Hua, Shaozhang Niu, Jiajun Chen, Ming Li, and Zhen Yue. "A Visually Secure Image Encryption Based on the Fractional Lorenz System and Compressive Sensing." Fractal and Fractional 6, no. 6 (May 29, 2022): 302. http://dx.doi.org/10.3390/fractalfract6060302.

Full text

Abstract:

Recently, generating visually secure cipher images by compressive sensing (CS) techniques has drawn much attention among researchers. However, most of these algorithms generate cipher images based on direct bit substitution and the underlying relationship between the hidden and modified data is not considered, which reduces the visual security of cipher images. In addition, performing CS on plain images directly is inefficient, and CS decryption quality is not high enough. Thus, we design a novel cryptosystem by introducing vector quantization (VQ) into CS-based encryption based on a 3D fractional Lorenz chaotic system. In our work, CS compresses only the sparser error matrix generated from the plain and VQ images in the secret generation phase, which improves CS compression performance and the quality of decrypted images. In addition, a smooth function is used in the embedding phase to find the underlying relationship and determine relatively suitable modifiable values for the carrier image. All the secret streams are produced by updating the initial values and control parameters from the fractional chaotic system, and then utilized in CS, diffusion, and embedding. Simulation results demonstrate the effectiveness of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

7

Alshammari, A. S. "Comparison of a Chaotic Cryptosystem with Other Cryptography Systems." Engineering, Technology & Applied Science Research 10, no. 5 (October 26, 2020): 6187–90. http://dx.doi.org/10.48084/etasr.3745.

Full text

Abstract:

The keyspace of a cryptography system must be long enough in order to protect it from brute force attacks. The One-Time Pad (OTP) encryption is unconditionally secure because of its truly random keystream that is used only once. This paper proposes a new chaotic symmetric cryptosystem approach, comparable to OTP. The proposed system utilizes two Lorenz generators, a main and an auxiliary, where the aim of the second one is to make one of the main Lorenz generator’s parameters to vary continually with time in a chaotic manner. This technique was built on digitizing two Lorenz chaotic models to increase the security level. The scrambling scheme was developed and the Lorenz stream cipher binary stream successfully passed the NIST randomness test. The cryptosystem showed a high degree of security, as it had a keyspace of 2576, and it was compared with existing symmetric key cryptography systems, such as DES, 3DES, AES, Blowfish, and OTP.

APA, Harvard, Vancouver, ISO, and other styles

8

Rohan, Dewanto Harwin, and Nur Hayati. "Persamaan Lorenz untuk Keamanan Nomor Serial Sistem Operasi Window7." Jurnal Ilmiah FIFO 10, no. 2 (March 1, 2019): 1. http://dx.doi.org/10.22441/fifo.2018.v10i2.001.

Full text

Abstract:

Serial number of operating system windows 7 needs to be safeguarded, so can’t be used by the others. Security of the data can use by modern cryptography such as Vernam Cipher methods and classic cryptography such as Caesar Cipher methods. The security level both of this method depends on the keywords used and it will difficult to crack if the random key is used more and more. To get a random key, we can take from chaos of Lorenz equations as key-generator for encryption and description. Before utilizing chaos in the Lorenz equations, we have to find the maximum t (time) for the inverse problem solution to fit with the forward problem solution. We can use Runge-Kutta method in the Lorenz equations for forward problem solution and inverse problem solution. The solution of integral that obtained by the Runge-Kutta method can be searched by Trapezoidal method. The result of Runge-Kutta solution and Trapezoidal will be used as key-generator for encryption and description. In the simulations performed, the best orde in Runge-Kutta method is 4 and t max is 2. The encryption key is used as the initial condition of Lorenz equation, then the result is integrable by the Trapezoidal method. The result of orde 4 from Runge-Kutta method and Trapezoidal method used as a key-generator. Application of Lorenz equation as key-generator for encryption and decryption, may change the cryptography algorithms of symmetric to be asymmetric.

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Xuncai, Lingfei Wang, Ying Niu, Guangzhao Cui, and Shengtao Geng. "Image Encryption Algorithm Based on the H-Fractal and Dynamic Self-Invertible Matrix." Computational Intelligence and Neuroscience 2019 (June 13, 2019): 1–12. http://dx.doi.org/10.1155/2019/9524080.

Full text

Abstract:

In this paper, an image encryption algorithm based on the H-fractal and dynamic self-invertible matrix is proposed. The H-fractal diffusion encryption method is firstly used in this encryption algorithm. This method crosses the pixels at both ends of the H-fractal, and it can enrich the means of pixel diffusion. The encryption algorithm we propose uses the Lorenz hyperchaotic system to generate pseudorandom sequences for pixel location scrambling and self-invertible matrix construction to scramble and diffuse images. To link the cipher image with the original image, the initial values of the Lorenz hyperchaotic system are determined using the original image, and it can enhance the security of the encryption algorithm. The security analysis shows that this algorithm is easy to implement. It has a large key space and strong key sensitivity and can effectively resist plaintext attacks.

APA, Harvard, Vancouver, ISO, and other styles

10

Nasry, Hany, Azhaar A. Abdallah, Alaa K. Farhan, Hossam E. Ahmed, and Wageda I. El Sobky. "Multi Chaotic System to Generate Novel S-Box for Image Encryption." Journal of Physics: Conference Series 2304, no. 1 (August 1, 2022): 012007. http://dx.doi.org/10.1088/1742-6596/2304/1/012007.

Full text

Abstract:

Abstract A novel method on the basis of multi chaos theory is suggested in the presented study. Also, the study used two different dimensions to generate S-Box to get a strong cipher that is difficult to break. The suggested image cryptosystem includes an identical (decryption and encryption) process, which involves a single keystream generator, shifting process (based on 3D Lorenz map) related diffusion operations, and generate S-Box (based on 2D Henon map) that related confusion operation. The comparative analysis and the simulate test show that the suggested image cryptosystem has a few properties, like high-sensitivity, fast encryption/decryption, large keyspace, excellent statistical properties related to the ciphertext, and so on. The suggested cryptosystem is considered as an alternative for practical secure communications.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Lorenz cipher system"

1

Sale, Tony. The Colossus computer, 1943-1996: And how it helped to break the German Lorenz cipher in WWII. Cleobury Mortimer, Shropshire: M & M Baldwin, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gannon, Paul. Colossus: Bletchley Park's greatest secret. London: Atlantic Books, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Secret days: Code-breaking in Bletchley Park. London: Frontline Books, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gannon, Paul. Colossus. Atlantic Books, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gannon, Paul. Colossus: Bletchley Park's Greatest Secret. Atlantic Books, Limited, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Colossus: Bletchley Park's Greatest Secret. Atlantic Books, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

1950-, Copeland B. Jack, ed. Colossus: The secrets of Bletchley Park's codebreaking computers. Oxford: Oxford University Press, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Lorenz cipher system"

1

Good, Irving John (. Jack). "From Hut 8 to the Newmanry." In Colossus. Oxford University Press, 2006. http://dx.doi.org/10.1093/oso/9780192840554.003.0025.

Full text

Abstract:

During the Second World War the Germans used two kinds of high-grade cryptographic system: Enigma, and what we called ‘Fish’. There were two forms of Fish. The official name for one was the Schlüsselzusatz (cipher attachment) SZ40 and 42, made by Lorenz, and which we called ‘Tunny’. The other was the Siemens T52, which we called ‘Sturgeon’. I worked on Enigma and on Tunny. After the outbreak of war I had to wait more than a year before I obtained suitable war work. My personality is not that of an officer and a gentleman, rather that of a philosopher and a mathematician, so I was not expected to join the army, other than, later on, the Home Guard. (On my first day in the Home Guard I was taught how to throw a hand grenade, although in years of compulsory cricket I was never taught how to bowl!) Eventually I was interviewed by the twice British chess champion Hugh Alexander, and the Cambridge mathematician Gordon Welchman. I knew Alexander in the chess world. I had another job offer which, unknown to me, would probably have involved work on radar. I chose Bletchley Park which I thought would be somewhat romantic. A few weeks before I joined Bletchley Park, when I was playing in a chess match where the chess master Stuart Milner-Barry, later knighted, was playing, probably on the top board, I was tactless enough to ask him whether he was working on German ciphers. He replied, ‘No, my address is Room 47, Foreign Office.’ Shortly thereafter, when I joined BP, he was there, sure enough working on German ciphers! At first the official address at Bletchley Park was indeed Room 47, Foreign Office, Whitehall, London, but soon it became permissible to give one’s private Bletchley address. I joined BP on 27 May 1941, the day the Bismarck was sunk, and was met at Bletchley railway station by Hugh Alexander. As we walked across a field, on the way to the office, Hut 8, he told me the exciting news that we were just beginning to read the German naval cipher system (which used the Enigma). I shall never forget that sensational conversation.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lorenz cipher system"

1

Alshammari, Ahmed S., Mohamed I. Sobhy, and Peter Lee. "Secure digital communication based on Lorenz stream cipher." In 2017 30th IEEE International System-on-Chip Conference (SOCC). IEEE, 2017. http://dx.doi.org/10.1109/socc.2017.8225999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!