A Study on Cubic Sieve Congruence.

Date of Submission

December 2003

Date of Award

Winter 12-12-2004

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Applied Statistics Unit (ASU-Kolkata)

Supervisor

Maitra, Subhamoy (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

In this dissertation we first explained the importance of eubie sieve congruener problem in the context of Cryptology. We justified an heuristic estimate of eardinality of S.. set of soluations fot enbie sieve congruenee problem with r, y and : of order pusing some statistieal methods. Then we presented an algorithm to solve the problem in timme better than O(p). Then we gave a met hod, which ean solve the problem in log time, but ouly for few primes. Finally, we suggested lurt her possible improvements to our proposrd algorithm.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843475

Control Number

ISI-DISS-2003-110

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6282

This document is currently not available here.

Share

COinS