An RSA cryptosystem based on Lehmer sequences in some classes of groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2106428 (Why is no real title available?)
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A method for obtaining digital signatures and public-key cryptosystems
- An extended theory of Lucas' functions.
- Cryptanalysis of short secret exponents modulo RSA primes.
- Fibonacci length and the generalized order k-Pell sequences of the 2-generator p-groups of nilpotency class 2
- Fibonacci lengths involving the Wall number k(n).
- Fixed points of the RSA encryption algorithm
- Lehmer sequences in finite groups
- Note on Lehmer-Pierce sequences with the same prime divisors
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- On the generalized order 2-Pell sequence of some classes of groups
- Shifted powers in Lucas-Lehmer sequences
- The k-nacci sequences and the generalized order-k Pell sequences in the semi-direct product of finite cyclic groups
- The generalized order \(k\)-Pell sequences in some special groups of nilpotency class 2
This page was built for publication: An RSA cryptosystem based on Lehmer sequences in some classes of groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006764)