Abstract
We set n = pq where p and q are odd primes. A number z is said to be an n-th residue modulo n 2 if there exists a nonnegative integer y such that z = y n mod n 2, where y is less than n 2 and is coprime to n 2. In this paper, we investigate n-th residues in the case of n = p 2 q where p and q are odd primes. We will give n-th residues in the case of n = 32ยท5, in particular.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benaloh, J.C.: Veryfiable Secret-Ballot Ellections, PhD Thesis, Yale University (1988)
Kurosawa, K., Itoh, T., Takeuchi, M.: Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number. Electronics Lettersย 23(15), 809โ810 (1987)
Naccache, D., Stern, J.: A new public-key Cryptosystem Based on Higher Residues. In: 5th ACM Conference on Computer and Communications Security, pp. 59โ66 (1998)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.ย 1592, pp. 223โ238. Springer, Heidelberg (1999)
Rabin, M.O.: Digitized signatures and public-key functions as intractable as factorization. MIT Laboratory for Computer Science Technical Report, LCS/TR-212 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
ยฉ 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adachi, T. (2011). Public-Key Cryptosystem Based on n-th Residuosity of n = p 2 q . In: Li, S., Wang, X., Okazaki, Y., Kawabe, J., Murofushi, T., Guan, L. (eds) Nonlinear Mathematics for Uncertainty and its Applications. Advances in Intelligent and Soft Computing, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22833-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-22833-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22832-2
Online ISBN: 978-3-642-22833-9
eBook Packages: EngineeringEngineering (R0)