The Rabin cryptosystem revisited
From MaRDI portal
Publication:2349533
DOI10.1007/s00200-014-0237-0zbMath1366.94488arXiv1108.5935OpenAlexW2104357149MaRDI QIDQ2349533
Matteo Piva, Michele Elia, Davide Schipani
Publication date: 22 June 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5935
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (1)
Cites Work
- Topics from the theory of numbers
- On the Rabin Signature
- Mathematics of Public Key Cryptography
- Improvements on Cantor-Zassenhaus Factorization Algorithm
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
- A modification of the RSA public-key encryption procedure (Corresp.)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Algebraic Graph Theory
- One-Wayness Equivalent to General Factoring
- Proving Tight Security for Rabin-Williams Signatures
- An Introduction to Mathematical Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Rabin cryptosystem revisited