A nonlinear public key cryptosystem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3693147 (Why is no real title available?)
- scientific article; zbMATH DE number 3630832 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Hiding information and signatures in trapdoor knapsacks
- New directions in cryptography
- On the reduction of pairs of Hermitian or symmetric matrices to diagonal form by congruence
- Probabilistic automata
- Secure communications over insecure channels
- Strong Primality Tests that are Not Sufficient
- The Pseudoprimes to 25 ⋅10 9
This page was built for publication: A nonlinear public key cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102923)