• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1105-1112
• /
• 2020

One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1597-1602
• /
• 2010

Sarkar et al. proposed a new Cellular Automata(CA) based security scheme providing both authentication and confidentiality. The application of CA for designing the scheme makes it suitable for hardware implementation. But the proposed method by Sakar dt al. has some problems. In this paper, we analyze CA and give a method for detecting secret key.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.219-227
• /
• 2001

In this study, the simulation was constructed using CA(Cellular Automata) rule to analyze the effect of incidents, which was verified using real-time VDS data and data collected on the field. The study analyzed the effect of incidents on highways by the simulation. The result appears to be statistically available with 5% of significance level. In order to analyze the effect of incident, the study classified time period of incidents and types of incidents in relation with traffic volume. Also, the effect of each type of incidents was analyzed in terms of time difference in sectional travel and delay time. In conclusion, little effect of incidents on traffic flow is noticed with light traffic volume but it becomes serious as the traffic volume increases. In addition, the delay happens to appear without incidents as the traffic volume increases over 2000 veh/hour. Also, when incidents happened during 45 minutes, the delay was about 425-722 veh·hour.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.25-30
• /
• 2004

Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.87-94
• /
• 2002

This study presents an MSB(Most Significant Bit) Int multiplier using cellular automata, along with a new MSB first multiplication algorithm over GF($2^m$). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of a PBCA(Periodic Boundary Cellular Automata) and with the property of irreducible AOP(All One Polynomial). The proposed multiplier can be used in the effectual hardware design of exponentiation architecture for public-key cryptosystem.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.1001-1008
• /
• 2019

A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.418-424
• /
• 2010

Many researchers studied methods for the generation of maximum length pseudo random sequences. Sabater et al. analyzed shrunken sequences which are effectively generated by SG(Shrinking Generator) using CA(Cellular Automata). In this paper we propose a new SG which is called LCSG(LFSR and CA based Shrinking Generator) using an LFSR with control register and CA with generator register. The proposed shrunken sequences generated by LCSG have longer periods and high complexities than the shrunken sequences generated by the known method. And we analyze the generated sequences using LCSG.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.1
• /
• pp.179-184
• /
• 2020

Cellular automata (CA), which is known as a pseudo random number generator due to its excellent randomness, has various applications. Cho et al. designed a CA-based shrinking generator to generate a long period of nonlinear sequence. In addition, chaotic cat maps have been studied by many researchers as the complex nonlinear dynamics systems with sensitivity in initial conditions and unpredictable characteristics. In this paper, we propose a new image encryption method using nonlinear sequence generated by CA-based shrinking generator with maximum period and 3D chaotic cat map for high security.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.155-158
• /
• 2008

In this paper, we propose a novel blind watermarking Method using 2D CAT (Two dimensional cellular automata transform). In our scheme, firstly, we obtain the gateway values to generate a dual-state, dual-coefficients basis function. Secondly, the basis function transforms images into cellular automata space. Lastly, we use the cellular automata transform coefficients to embed random noise watermark in the cover images. The proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values, better security is guaranteed. Moreover, the new method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.3-9
• /
• 2005

The recent notion of Network Centric Warfare (NCW) emphasizes the ability to distribute right information at the right time to maximize the combat effectiveness. Accordingly, in the modern combat system the importance of non-physical element, such as communication system is increasing. However, an NCW-support communication network system is expensive. Therefore, it is essential to develop a proper combat system evaluation method to establish an efficient NCW-support combat system. Traditionally, combat system effectiveness is measured in terms of physical elements such as men and fire power. Obviously, such method is hardly applicable to a modern combat system To overcome this difficulty, we propose an evaluation model based on CA (Cellular Automata) simulation. A set of preliminary combat simulations show that CA simulation may be promising in evaluating non-physical element of a modem combat system.