A key distribution system equivalent to factoring
From MaRDI portal
Publication:1112781
DOI10.1007/BF02351718zbMath0659.94003OpenAlexW2033535959MaRDI QIDQ1112781
Publication date: 1988
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02351718
Related Items (24)
A key-exchange protocol using real quadratic fields ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ A new public key scheme based on DRSA and generalized GDLP ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Batch Diffie-Hellman key agreement systems ⋮ Mathematical problems in cryptology ⋮ A new public key cryptosystem over ℤn2* ⋮ An elliptic curve analogue of McCurley's key agreement scheme ⋮ On reducing factorization to the discrete logarithm problem modulo a composite ⋮ An interactive identification scheme based on discrete logarithms and factoring ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ A public key encryption scheme based on factoring and discrete logarithm ⋮ Cascade ciphers: The importance of being first ⋮ The RSA group is pseudo-free ⋮ A Digital Signature Scheme Based on Two Hard Problems ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ A variant of digital signature algorithm ⋮ Perfectly secure key distribution for dynamic conferences ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ Security analysis and improvement of a double-trapdoor encryption scheme ⋮ A traceable group signature scheme. ⋮ A new cryptosystem using generalized Mersenne primes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of factoring
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Riemann's hypothesis and tests for primality
- Fast evaluation of logarithms in fields of characteristic two
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Elliptic Curve Cryptosystems
- New directions in cryptography
- A modification of the RSA public-key encryption procedure (Corresp.)
- A method for obtaining digital signatures and public-key cryptosystems
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
This page was built for publication: A key distribution system equivalent to factoring
