Nothing Special   »   [go: up one dir, main page]

Skip to main content

On a Cipher Based on Pseudo-random Walks on Graphs

  • Conference paper
Cryptography and Security Systems (CSS 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 448))

Included in the following conference series:

  • 1085 Accesses

Abstract

In the paper a cipher which uses transition graph in the encryption and decryption processes is presented. It is created based on some ideas of dynamic systems (symbolic dynamics). The introduced cipher is tested according to the suggestions of FIPS 140-2 standard and the results are presented in the paper.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Foryś, W., Oprocha, P.: Pseudo-random walks on graphs and cryptography. In: Proceedings of the 2009 International Conference on Foundations of Computer Science, FCS 2009, Las Vegas, Nevada, USA (2009)

    Google Scholar 

  2. Kapitaniak, T.: Controlling chaos. Theoretical and practical methods in non-linear dynamics. Academic Press, London (1996)

    MATH  Google Scholar 

  3. Kotulski, Z., Szczepański, J.: Discrete chaotic cryptography. Ann. Physics 6, 381–394 (1997)

    Article  MATH  Google Scholar 

  4. Lind, D., Marcus, B.: Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995)

    Google Scholar 

  5. Maskanen, T.: On finite automaton public key cryptosystem. TUCS, Technical Raport, 408 (2001)

    Google Scholar 

  6. Masuda, N., Aihara, K.: Cryptosystems based on space-discretization of chaotic maps. IEEE Trans. Circuits Systems I Fund. Theory Appl. 49, 329–334 (1983)

    MathSciNet  Google Scholar 

  7. Menezes, A., van Oorshot, P., Vanstone, S.: Handbook of applied cryptography. CRC Press Inc., Boca Raton (1997)

    MATH  Google Scholar 

  8. Quiquater, J.-J.: Cryptology and graph theory. UCL Crypto Group, EIDMA (2005)

    Google Scholar 

  9. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22 Revision 1a, U.S. Department of Commerce, National Institute of Standards and Technology, Gaithersburg (2010)

    Google Scholar 

  10. Soto, J., Bassham, L.: Randomness Testing of the Advanced Encryption Standard Finalist Candidates. U.S. Department of Commerce, National Institute of Standards and Technology, Gaithersburg (2000)

    Google Scholar 

  11. Soto, J.: Randomness Testing of the Advanced Encryption Standard Candidate Algorithms. U.S. Department of Commerce, National Institute of Standards and Technology, Gaithersburg (1999)

    Google Scholar 

  12. Vithanage, A., Shimizu, T.: FIPS 140-2 (Change Notice 1), Random Number Tests. HM-RAE 103-0403, FDK Corporation (2003)

    Google Scholar 

  13. Zwierko, A.: Testowanie generatorów pseudolosowych — wybrane programowe pakiety testów statystycznych. In: Enigma 2003 — VII Krajowa Konferencja Zastosowań Kryptografii, Warszawa (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Foryś, W., Jęda, Ł., Oprocha, P. (2014). On a Cipher Based on Pseudo-random Walks on Graphs. In: Kotulski, Z., Księżopolski, B., Mazur, K. (eds) Cryptography and Security Systems. CSS 2014. Communications in Computer and Information Science, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44893-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44893-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44892-2

  • Online ISBN: 978-3-662-44893-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics