On integer sequences in cryptography
From MaRDI portal
Cites work
- A computational introduction to number theory and algebra
- A cryptanalytic attack on the LUC cryptosystem using continued fractions
- A cryptography method based on hyperbolic balancing and Lucas-balancing functions
- A Direct Interpretation of Gandhi's Formula
- A fast, high quality, and reproducible parallel lagged-Fibonacci pseudorandom number generator
- A generalization of the Catalan numbers
- A method for obtaining digital signatures and public-key cryptosystems
- A natural prime-generating recurrence
- A new public-key cryptosystem via Mersenne numbers
- A note on the k-Narayana sequence
- A public-key cryptosystem based on Lucas sequences
- A variant of the Narayana coding scheme
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Breaking RSA may not be equivalent to factoring
- Catalan Numbers
- Communication Theory of Secrecy Systems*
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Diophantine Representation of the Set of Prime Numbers
- Discrete Convolutions via Mersenne Transforms
- Elliptic Curve Cryptosystems
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Fibonacci and Catalan numbers. An introduction
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Fibonacci and Lucas numbers with applications. Volume I
- Generating safe primes
- History of a Formula for Primes
- scientific article; zbMATH DE number 4132091 (Why is no real title available?)
- scientific article; zbMATH DE number 5139182 (Why is no real title available?)
- scientific article; zbMATH DE number 5693952 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1030971 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- scientific article; zbMATH DE number 1455081 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 861252 (Why is no real title available?)
- scientific article; zbMATH DE number 5068439 (Why is no real title available?)
- scientific article; zbMATH DE number 3351674 (Why is no real title available?)
- scientific article; zbMATH DE number 3361954 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- Lagged Fibonacci random number generators for distributed memory parallel computers
- Lucas Pseudoprimes
- Mersenne twister
- New directions in cryptography
- New Primality Criteria and Factorizations of 2 m ± 1
- On Formulae for the Nth Prime Number
- On identities with multinomial coefficients for Fibonacci-Narayana sequence
- On the security of the Lucas function
- Repdigits in Narayana's cows sequence and their consequences
- Robust transmission of unbounded strings using Fibonacci representations
- Security Analysis of the Strong Diffie-Hellman Problem
- Solving the Pell equation
- Some remarks concerning the M.I.T. public-key cryptosystem
- Strong Primes are Easy to Find
- The Lucas Sequences
- Theorems on prime numbers.
- Universal codeword sets and representations of the integers
This page was built for publication: On integer sequences in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228703)
