Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cellular Automata

ACRI 2006: Cellular Automata pp 636–645Cite as

Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography

  • Conference paper

  • 2229 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4173))

Abstract

The paper proposes a methodology to generate family of expander graphs based on Two Predecessor Single Attractor Cellular Automata (TPSA-CA). The construction is finally applied to develop a one-way function whose security lies on the combinatorial properties of the expander graph. It is shown that while the forward transformation of the one-way function is computationally efficient the inverse operation appears to be intractable. Such a one-way function can be an ideal candidate for one-way functions and thus help to develop fast and secure key establishment protocols.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldreich, O.: Candidate One-Way Functions Based on Expander Graphs. Cryptology ePrint Archive, Report 2000/063 (2000)

    Google Scholar 

  2. Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory (22), 644–654 (1976)

    Google Scholar 

  3. Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application, ch. 4, vol. 1. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  4. Linial, N., Wigderson, A.: Expander graphs and their applications (2003)

    Google Scholar 

  5. Nielsen, M.A.: Introduction to expander graphs (2005)

    Google Scholar 

  6. Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261–277 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. Margulis, G.A.: Explicit constructions of expanders. Problemy Peredači Informacii 9(4), 71–80 (1973)

    MATH  MathSciNet  Google Scholar 

  8. Margulis, G.A.: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii 24(1), 51–60 (1988)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PhD Student, Department of Computer Science and Engg., Indian Institute of Technology, Kharagpur, India

    Debdeep Mukhopadhyay

  2. Associate Professor, Department of Computer Science and Engg., Indian Institute of Technology, Kharagpur, India

    Dipanwita RoyChowdhury

Authors
  1. Debdeep Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dipanwita RoyChowdhury
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Mathematics, Physics and Systems, University of Perpignan, 52, Paul Alduy Avenue, 66860, Perpignan, Cedex, France

    Samira El Yacoubi

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Research Center on Complex Systems and Artificial Intelligence (CSAI) Department of Computer Science, Systems and Communication (DISCo), University of Milan, Bicocca viale Sarca, 336, 20126, Milan, (Italy)

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhopadhyay, D., RoyChowdhury, D. (2006). Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_74

Download citation

  • DOI: https://doi.org/10.1007/11861201_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40929-8

  • Online ISBN: 978-3-540-40932-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation