scientific article

zbMath0648.10001MaRDI QIDQ3792737

Neal Koblitz

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

RSAfinite fieldspublic key cryptosystemsknapsackexercisesquadratic residuescomputational number theoryfactoring methodsdiscrete logprobabilistic primality testsrho methodanswerselliptic curve factorization method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Elliptic curves (14H52) Congruences; primitive roots; residue systems (11A07) Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Primes (11A41)

Related Items (35)

Finding pseudoprimes ⋮ A one-way function from thermodynamics and applications to cryptography ⋮ Efficient data mappings for parity-declustered data layouts ⋮ Geometry of \(p\)-adic Siegel discs ⋮ Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Speeding up the computations of elliptic curves cryptoschemes ⋮ Analysis and design of a secure key exchange scheme ⋮ Batch Diffie-Hellman key agreement systems ⋮ Applying quick exponentiation for block upper triangular matrices ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Hyperelliptic cryptosystems ⋮ RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ On the subfield subcodes of Hermitian codes ⋮ An approximate expression related with RSA fixed points ⋮ Distributed user identification by zero-knowledge access rights proving ⋮ Some remarks on the arithmetic properties of recursive sequences on elliptic curves over a finite field ⋮ A congruence for the number of alternating permutations ⋮ The block cipher Square ⋮ Cryptanalysis of a public key system based on Diophantine equations ⋮ Density of Carmichael numbers with three prime factors ⋮ A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli ⋮ A nonlinear elliptic curve cryptosystem based on matrices ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces ⋮ A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms ⋮ On the security properties of Russian standardized elliptic curves ⋮ An algorithmic view of pseudochaos ⋮ New algorithms and protocols for information authentication in automatic control systems ⋮ Cryptography and elliptic curves ⋮ On Carmichael polynomials ⋮ Generalized strong pseudoprime tests and applications ⋮ Elliptic curve cryptosystems and their implementation ⋮ Some remarks on strong Fibonacci pseudoprimes

This page was built for publication: