Advisor

Sort by: Order: Results:

  • The Number Field Sieve Factoring Algorithm 
    KUMAR, RAHUL (2012-04)
    Integer factorization has been interesting problem for mathematicians since centuries. Integer factorisation lies in the heart of Number Theory. There has been many algorithms for factorisation such as Dixon’s factorisation, ...
  • Cryptanalysis of the A5/1 Stream Cipher 
    SHAH, JAY (2012-05)
    In Europe and North America, the most widely used stream cipher to ensure privacy and confidentiality of conversations in GSM mobile phones is the A5/1. In this thesis, we study the A5/1 and some known attacks on it. We ...
  • On improvements of $r$-adding walks to solve the Discrete Logarithm Problem 
    GAJERA, HARDIK (2013-05)
    It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k\sqrt{N}$ where $N$ is the order of the ...
  • Function Field Sieve: Recent advances in the index-calculus attack on the discrete logarithm problem 
    K, HARIRAM (2015-05)
    In this paper we look into the discrete log problem over finite fields. The relative hardness of this problem defines the integrity of many cryptographic systems. Therefore the ease of solvalbility of this problem has been ...
  • Secret sharing schemes and application to e-voting 
    PREETI, P (2015-05)
    We present a way of sharing a secret S into n shares such that the collusion of any k shares results in the reconstruction of secret S and no k − 1 shares can do so. This way of sharing secret was first introduced by ...
  • McEliece-type CryptosysteMS over Quasi-cyclic Codes 
    KAPSHIKAR, UPENDRA (2018-05)
    Most of the cryptosystems that we use today, are based on hardness of factoring or discrete log in one way or other. As soon as quantum computers become reality, such systems will break down. In this work, we suggest a ...
  • Permutation error-correcting codes and their applications to public-key cryptography 
    SRINIVASAN, ADARSH (2021-06)
    In this thesis, we study some computational problems in permutation group theory and their applications to public-key cryptography. The primary goal of this thesis is to come up with a cryptosystem similar to the McEliece ...

Search Repository


Advanced Search

Browse

My Account