Skip to main content

PERIDOT Codes: Replacing Identifiers, Sequence Numbers, and Nonces with Permutations

  • Conference paper
  • First Online:
30th Biennial Symposium on Communications 2021

Part of the book series: Signals and Communication Technology ((SCT))

Abstract

Identifiers and sequence numbers make up a large part of the protocol overhead in certain low-power wide-area networks. The requirement for cryptographic nonces in authentication and encryption schemes often demands excessively long sequence numbers, which leads to an increase in energy consumption per transmitted packet. In this chapter, the novel PERIDOT coding scheme is proposed. It replaces identifiers and sequence numbers with a code, based on which receivers can identify transmitters with high confidence. PERIDOT is based on specially constructed integer permutations assigned to transmitters. An upper bound on the performance of PERIDOT codes is provided, and methods for constructing particularly suitable permutations are presented. In practice, PERIDOT can significantly increase intervals between nonce reuses and, at the same time, reduce power consumption.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Sigfox connected objects: Radio specifications v1.5, Sigfox (February 2020)

    Google Scholar 

  2. LoRaWANTM 1.1 Specification, LoRa Alliance (October 2017)

    Google Scholar 

  3. Alspach, B.: The wonderful Walecki construction. Bull. Instit. Combinat. Appl. 52, 7–19 (2006)

    MathSciNet  MATH  Google Scholar 

  4. Tillson, T.W.: A Hamiltonian decomposition of \(K_{2m}^{*}\), 2m ≥ 8. J. Combinat. Theory Ser. B 29(1), 68–74 (1980)

    Google Scholar 

  5. Kløve, T., Bose, B., Elarief, N.: Systematic, single limited magnitude error correcting codes for flash memories. IEEE Trans. Inf. Theory 57(7), 4477–4487 (2011)

    Article  MathSciNet  Google Scholar 

  6. Xie, D., Luo, J.: Asymmetric single magnitude four error correcting codes. CoRR abs/1903.01148 (2019). http://arxiv.org/abs/1903.01148

  7. Kløve, T., Luo, J., Naydenova, I., Yari, S.: Some codes correcting asymmetric errors of limited magnitude. IEEE Trans. Inf. Theory 57, 7459–7472, 12 (2011)

    Google Scholar 

  8. Sigfox - The Global Communications Service Provider for the Internet of Things (IoT). https://www.sigfox.com/en. Accessed 20 March 2020

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian Euchner .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Euchner, F., Senger, C. (2022). PERIDOT Codes: Replacing Identifiers, Sequence Numbers, and Nonces with Permutations. In: Nguyen, H., Le, L., Yahampath, P., Mohamed, E.B. (eds) 30th Biennial Symposium on Communications 2021. Signals and Communication Technology. Springer, Cham. https://doi.org/10.1007/978-3-031-06947-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-06947-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-06946-8

  • Online ISBN: 978-3-031-06947-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics