---
title: "Introduction"
canonical: "https://docs.magma-maths.org/CodingTheory/PseudoRandomBitSequences/introduction.html"
source: "https://docs.magma-maths.org/CodingTheory/PseudoRandomBitSequences/introduction.md"
part: "Coding Theory"
chapter: "Pseudo-Random Bit Sequences"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Coding Theory", "source": "../index-coding-theory.md"}
  - {"title": "Pseudo-Random Bit Sequences", "source": "index-pseudo-random-bit-sequences.md"}
prev: {"title": "Pseudo-Random Bit Sequences", "source": "index-pseudo-random-bit-sequences.md"}
next: {"title": "Linear Feedback Shift Registers", "source": "lfsr.md"}
---

# Introduction

Magma provides some tools for the creation and analysis of pseudo-random bit sequences. The universe of these sequences is generally ${\bf F}_{2}$. However, some functions, such as `BerlekampMassey`, may be applied to sequences defined over arbitrary finite fields. The chapter closes with the SHA-1 hash function, which maps a string or byte sequence of any length to a digest of fixed length.