Browse > Article
http://dx.doi.org/10.6109/jkiice.2011.15.9.1939

Expander graphs based on 60/102 NBCA and its application  

Kim, Han-Doo (인제대학교, 기초과학연구소)
Cho, Sung-Jin (부경대학교)
Choi, Un-Sook (동명대학교)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.15, no.9, 2011 , pp. 1939-1946 More about this Journal
Abstract
Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et. al introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor CA(Cellular Automata). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is larger than that of Mukhopadhyay et. al [12]. As an application we give an algorithm which generate one-way functions whose security lies on the combinatorial properties of our expander graphs. the one-way function using d-regular graph generated by the 60/102 NBCA is based on the Goldreich's construction [5].
Keywords
expander graph; 60/102 NBCA; one-way function; adjacency matrix; bipartite graph; security;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Mukhopadhyay and D.R. Chowdhury, Generation of expander graphs using cellular automata and its applications to cryptography, ACRI 2006, LNCS Vol. 4173, pp. 636-645, 2006.
2 M.S. Pinker, On the complexity of a concentrator, In 7th International Telegraffic Conference, 1973.
3 S. Hoory, N. Lindal, and A. Wigderson, Expander graphs and their applications, Bull. AMS, Vol. 43, pp. 439-561, 2006.   DOI   ScienceOn
4 D. Peleg and E. Upfal, Constructing disjoint paths on expander graphs, Combinatorica, Vol. 9, pp. 289-313, 1989.   DOI   ScienceOn
5 M. Sipser and D. Spielman, Expander codes, IEEE Transactions on Information Theory, Vol. 42, pp. 1710-1722, 1996.   DOI   ScienceOn
6 O. Goldreich, Candidate one-way functions based on expander graphs, Cryptology ePrint Archieve, Report 200/063, pp. 1-9, 2000.
7 W. Diffie and M. Hellman, New directions in cryptography, in IEEE Transaction on Information Theory, Vol. 22, pp. 644-654, 1976.   DOI
8 S.J. Cho, U.S. Choi, H.D. Kim, and Y.H. Hwang, Analysis of complemented CA derived from linear hybrid group CA, Computers and Mathematics with Applications, Vol. 53, pp. 54-63, 2007.   DOI   ScienceOn
9 P. Pal Chaudhuri, D. Roy Chowdhury, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata Theory and its Applications Vol. 1, IEEE Computer Society Press, 1997.
10 S.J. Cho, U.S. Choi, H.D. Kim, Y.H. Hwang, J.G. Kim, and S.H. Heo, New synthesis of one-dimensional 90/150 linear hybrid group cellular automata, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 26, pp. 1720-1724, 2007.   DOI   ScienceOn
11 M.A. Nielsen, Introduction to expander graphs, www.ginfo.org/people/nielsen/blog/archive/notes/expander-graphs.pdf, 2005.
12 J. Cheeger, A lower bound for the smallest eigenvalue of the Laplacian, In Problems in analysis (Papers dedicated to Solomon Bochner, 1969, pp. 195-199), Princeton Univ. Press, Princeton, N.J., 1970.