Show simple item record

dc.contributor.authorMaitra, Submahoy
dc.contributor.authorRao, Subba, Y. V.
dc.contributor.authorStănică, Pantelimon
dc.contributor.authorGangopadhyay, Sugata
dc.date.accessioned2014-02-18T23:35:47Z
dc.date.available2014-02-18T23:35:47Z
dc.date.issued2009
dc.identifier.citationSpecial Issue on Applied Cryptography & Data Security in Journal of “Computacion y Sistemas” 12:3 (2009) (eds. F. Rodrıguez-Henrıquez, D. Chakraborty), 253-266.
dc.identifier.urihttp://hdl.handle.net/10945/38831
dc.description.abstractIn this paper we discuss the problem of finding nontrivial solutions to the Cubic Sieve Congruence probem, that is, solutions of x2 = y2z (mod p), where x,y,z < p1/2 and x3 = y2z. The solutions to this problem are useful in solving the Discrete Log Problem or factorization by index calculus method.. Apart from the cryptographic interest, this problem is motivatin by itself from a number theoretic point of view. Though we could not solve the problem completely, we could identify certain subclasses of primes where the problem can be solved in time polynomial in log p. Further we could extend the idea of Reynert's sieve and identify some cases where the problem can even be solved in constant tiem. Designers of ctyptosystems should avoid all primes contained in our detected cases.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleNontrivial solutions to the cubic sieve congruence problem x^3=y^2 z (mod p)en_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentApplied Mathematics
dc.subject.authorCubic Sieve congruenceen_US
dc.subject.authorDiscrete Log problemen_US
dc.subject.authorprime numbersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record