Skip to main content
Ctrl+K
Magma Magma
  • About
    About News Members
  • Documentation
    Handbook Official Handbook Release Notes Patch Notes
  • Mathematical Areas
  • Try
  • Subscriptions
  • Download
  • Contact
  • Explore
    Tutorials Conferences Seminars Databases Third Party Libraries How to Cite Support Citation Database
  • About
    About News Members
  • Documentation
    Handbook Official Handbook Release Notes Patch Notes
  • Mathematical Areas
  • Try
  • Subscriptions
  • Download
  • Contact
  • Explore
    Tutorials Conferences Seminars Databases Third Party Libraries How to Cite Support Citation Database
  • Preface
  • The Magma Language
  • Sets, Sequences and Mappings
  • Basic Rings
  • Matrices and Linear Algebra
  • Lattices and Quadratic Forms
  • Global Fields
  • Local Fields
  • Modules
  • Finite Groups
  • Finitely Presented Groups
  • Algebras
  • Representation Theory
  • Lie Theory
  • Commutative Algebra
  • Algebraic Geometry
  • Arithmetic Geometry
  • Modular Arithmetic Geometry
  • Topology
  • Geometry
  • Combinatorics
  • Coding Theory
  • Cryptography
  • Optimization
  • References
  • Cryptography

Cryptography#

Pseudo-random Bit Sequences

Generation and testing of pseudo-random bit sequences.

Pseudo-Random Bit Sequences

previous

Hilbert Spaces

next

Pseudo-Random Bit Sequences
Magma Magma

Magma is maintained and distributed by the Computational Algebra Group, School of Mathematics and Statistics, University of Sydney.

University of Sydney

Explore

  • Home
  • Preface
  • References
  • General Index

Community

  • Members
  • Visitors
  • Seminars
  • Conferences
  • News

Help

  • FAQ
  • Contact
  • Licensing
  • How to Cite
  • Main Website ↗
© 1993–2026 Computational Algebra Group. All rights reserved. Built at the University of Sydney, Australia.