An efficient binary sequence generator with cryptographic applications
From MaRDI portal
Publication:2570684
Recommendations
- An efficient algorithm to generate binary sequences for cryptographic purposes
- scientific article; zbMATH DE number 2013394
- On a secure binary sequence generated by a quadratic polynomial on \(\mathbb{Z}_{2^n}\)
- Binary Pseudo-Random Sequences Theory
- On finite pseudorandom binary sequences and their applications in cryptography
Cites work
- A family of keystream generators with large linear complexity
- A Simple Unpredictable Pseudo-Random Number Generator
- An efficient algorithm to generate binary sequences for cryptographic purposes
- scientific article; zbMATH DE number 3792089 (Why is no real title available?)
- scientific article; zbMATH DE number 17389 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 1440878 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- Linear Complexity and Random Sequences
- Shift-register synthesis and BCH decoding
Cited in
(6)- Optimizing matrix operations in \(\mathbb Z_2\) by word packing
- A new approach to analyze the independence of statistical tests of randomness
- A matrix PRNG with s-box output filtering
- scientific article; zbMATH DE number 2013394 (Why is no real title available?)
- Shift Register Sequences
- scientific article; zbMATH DE number 3273526 (Why is no real title available?)
This page was built for publication: An efficient binary sequence generator with cryptographic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570684)