Skip to main content

Modelling of Process of Electronic Signature with Petri Nets and (Max, Plus) Algebra

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

This article discusses the modelling and the evaluation of process of electronic signature (ES). According to a certain point of view, this process can be shown as a class of Dynamic Discrete Event Systems (DDES). It is in this framework that we study this class with using Petri Nets (PN) and the theory of linear systems in (max, +) algebra. We introduce these two formalisms with the aim to describe the graphical and analytical behaviours of studied process. The resolution of (max, +) model which describes the system enables us to evaluate the process performances in terms of occurrence dates of various events that compose it (authentication, hashcoding, signature, timestamping). To illustrate our methodology, we finish this article with a numerical example.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

References

  1. Baccelli, F., Cohen, G., Olsder, G.L., Quadrat, J.P.: Synchronisation and linearity: an algebra for Discrete Event Systems. Wiley, Chichester (1992)

    Google Scholar 

  2. Dobbertin, H., Bosselaers, A., Preneel, B.: RIPEMD-160, a strengthened version of RIPEMD. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 71–82. Springer, Heidelberg (1996)

    Google Scholar 

  3. Gaubert, S.: Théorie des systèmes linéaires dans les dioïdes, Thèse de doctorat, Ecole National Supérieure des mines de Paris (Juillet 1992)

    Google Scholar 

  4. Kaeo, M.: Designing Network Security. Macmillan Technical Publishing, USA (1999) ISBN:1-57870-043-4

    Google Scholar 

  5. Kaliski, Jr. B.S.: RFC 1319: The MD2 Message-Digest Algorithm. RSA Laboratories (Janvier 1992)

    Google Scholar 

  6. Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, USA (Février 2001) ISBN 0-8493-8523-7

    Google Scholar 

  7. Nait-Sidi-Moh, A.: Contribution à la modélisation, à l’analyse et à la commande des systèmes de transport public par les réseaux de Petri et l’algèbre (Max, Plus). Thèse de doctorat en Automatique et Informatique, Université de Technologie de Belfort-Montbéliard et Université de Franche-Comté, Décembre (2003)

    Google Scholar 

  8. National Institute of Standards and Technology, Secure Hash Standard (SHS). Federal Information Processing Standards Publication, FIPS PUB 180-1 (April 1995)

    Google Scholar 

  9. National Institute of Standards and Technology, Data Encryption Standard (DES). Federal Information Processing Standards Publication, FIPS PUB 46-3 (Octobre 1999)

    Google Scholar 

  10. National Institute of Standards and Technology, Digital Signature Standard (DSS). Federal Information Processing Standards Publication, FIPS PUB 186-2 (Janvier 2000)

    Google Scholar 

  11. Preneel, B., Bosselaers, A., Dobbertin, H.: The cryptographic hash function RIPEMD-160. CryptoBytes 3(2), 9–14 (1997)

    Google Scholar 

  12. David, R., Alla, H.: du grafcet aux réseaux de Petri. Série Automatique, hermes, Paris (1992)

    Google Scholar 

  13. Rieupet, D., Wack, M., Cottin, N., Assossou, D.: Signature électronique multiple. Atelier Sécurité des Systèmes d’Information, XXIIème Congrès INFORSID (Mai 2004)

    Google Scholar 

  14. Rivest, R.L.: RFC 1320: The MD4 Message-Digest Algorithm. MIT Laboratory for Computer Science and RSA Data Security (Avril 1992)

    Google Scholar 

  15. RSA Data Security Inc., Public Key Cryptography Standards, PKCS 1-12. disponible en ligne à (1993), ftp://ftp.rsa.com/pub/pkcs

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nait-Sidi-Moh, A., Wack, M. (2005). Modelling of Process of Electronic Signature with Petri Nets and (Max, Plus) Algebra. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_83

Download citation

  • DOI: https://doi.org/10.1007/11424925_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics