SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
From MaRDI portal
Publication:3798591
DOI10.1080/0161-118591859942zbMATH Open0652.94012OpenAlexW1995503223MaRDI QIDQ3798591FDOQ3798591
Authors: Hugh C. Williams
Publication date: 1985
Published in: Cryptologia (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0161-118591859942
Recommendations
Cited In (26)
- EXTENSION OF RSA CRYPTOSYSTEMS TO MATRIX RINGS
- Title not available (Why is that?)
- Cryptoanalysis of cryptosystems based on the quadratic residue problem
- FACTORING VIA SUPERENCYRPTION
- Coding and Cryptography
- Some Public-Key Crypto-Functions as Intractable as Factorization
- The Rabin cryptosystem revisited
- Applications to cryptography of twisting commutative algebraic groups
- A cubic analogue of the RSA cryptosystem
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
- Analogue of the RSA-cryptosystem in quadratic unique factorization domains
- Title not available (Why is that?)
- RSA cryptosystem in the domain \(Z[\omega]\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public key encryption and signature schemes based on polynomials over \(\mathbb{Z}_n\)
- Title not available (Why is that?)
- A public key cryptosystem as hard as factorisation
- Homomorphic Encryption and Signatures from Vector Decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
- Permutation polynomials in RSA-cryptosystems
- Title not available (Why is that?)
- Proof Checking the RSA Public Key Encryption Algorithm
- The multi-dimension RSA and its low exponent security
This page was built for publication: SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798591)