Skip to main content
SpringerLink
Log in

Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories

  • Book
  • © 2021

Overview

Authors:
  1. Malek Safieh

    1. University of Ulm, Munich, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Introduction

    • Malek Safieh
    Pages 1-4

  3. Elliptic Curve Cryptography

    • Malek Safieh
    Pages 5-23

  4. Elliptic Curve Cryptography over Gaussian Integers

    • Malek Safieh
    Pages 25-42

  5. Montgomery Arithmetic over Gaussian Integers

    • Malek Safieh
    Pages 43-59

  6. Architecture of the ECC Coprocessor for Gaussian Integers

    • Malek Safieh
    Pages 61-81

  7. Compact Architecture of the ECC Coprocessor for Binary Extension Fields

    • Malek Safieh
    Pages 83-96

  8. The Parallel Dictionary LZW Algorithm for Flash Memory Controllers

    • Malek Safieh
    Pages 97-130

  9. Conclusion

    • Malek Safieh
    Pages 131-132

  10. Back Matter

    Pages 133-142
    Download chapter PDF
Back to top

Keywords

About this book

In this work, algorithms and architectures for cryptography and source coding are developed, which are suitable for many resource-constrained embedded systems such as non-volatile flash memories. A new concept for elliptic curve cryptography is presented, which uses an arithmetic over Gaussian integers. Gaussian integers are a subset of the complex numbers with integers as real and imaginary parts. Ordinary modular arithmetic over Gaussian integers is computational expensive. To reduce the complexity, a new arithmetic based on the Montgomery reduction is presented. For the elliptic curve point multiplication, this arithmetic over Gaussian integers improves the computational efficiency, the resistance against side channel attacks, and reduces the memory requirements. Furthermore, an efficient variant of the Lempel-Ziv-Welch (LZW) algorithm for universal lossless data compression is investigated. Instead of one LZW dictionary, this algorithm applies several dictionaries to speed up the encoding process. Two dictionary partitioning techniques are introduced that improve the compression rate and reduce the memory size of this parallel dictionary LZW algorithm.

Authors and Affiliations

  • University of Ulm, Munich, Germany

    Malek Safieh

About the author

Malek Safieh is a research scientist in the field of cryptography and data compression.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation