A new Rabin-type trapdoor permutation equivalent to factoring
From MaRDI portal
Publication:2804935
DOI10.1016/J.ENTCS.2005.09.039zbMATH Open1294.94076OpenAlexW2056539738MaRDI QIDQ2804935FDOQ2804935
Publication date: 6 May 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2005.09.039
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Secure integration of asymmetric and symmetric encryption schemes
- Breaking RSA may not be equivalent to factoring
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
- Title not available (Why is that?)
- Information and Communications Security
- Progress in Cryptology – Mycrypt 2005
- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: A new Rabin-type trapdoor permutation equivalent to factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804935)