Browsing by Advisor "Veni Madhavan, C E"
Now showing items 1-19 of 19
-
algorithms for coloring random and semi-random graphs
The graph coloring problem is NP-hard and arises in a variety of practical situations. Recent breakthroughs in the area of approximation complexity indicate that it is not possible (unless P = NP) even to approximate the ... -
Algorithms for testing planarity of chordal graphs and hamiltonicity of planar chordal graphs.
Design and analysis of graph algorithms is an active research area in Computer Science. Designing efficient algorithms for graph problems is both challenging and rewarding from the point of view of theory and applications. ... -
Analysis And Design Of Image And Video Encryption Algorithms
(2009-03-19)The rapid growth in multimedia based Internet systems and applications like video telephony, video on demand, network based DVD recorders and IP television has created a substantial need for ... -
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences
(2011-01-25)In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ... -
Bayes Optimal Feature Selection for Supervised Learning
(2018-02-18)The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ... -
Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks
(2013-09-17)The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ... -
Counting number of points on elliptic curves over F2m fields : An implementation study
Hasse’s theorem states that:ifE {W g) Then |i| < 2y/q. This gives the bound on the number of points. In 1985, Schoof presented a polynomial time algorithm for computing The algorithm has running time of 0(log® q) bit ... -
Dependency-lattices, acyclic hypergraphs and relational database scheme design
Compared to other models of data, the relational model offers several advantages: Clear separation between logical organization and physical storage of data Ease of understanding the logical structure Use of high-level ... -
Efficient computations with special large sparse matrices
Large sparse matrices find many applications in cryptography. A large sparse matrix is a matrix of huge dimensions but the number of nonzero entries per row of the matrix is very small. Most of the times, it is possible ... -
Galois field Computations : Implementation of a Library and a study of the Discrete Logarithm Problem
Computation over finite fields (also called Galois fields) is an active area of research in number theory and algebra, and finds many applications in cryptography, error control coding, and combinatorial design. In this ... -
Graph Models For Query Focused Text Summarization And Assessment Of Machine Translation Using Stopwords
(2014-04-09)Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ... -
Image Structures For Steganalysis And Encryption
(2013-10-21)In this work we study two aspects of image security: improper usage and illegal access of images. In the first part we present our results on steganalysis – protection against improper usage of images. In the second part ... -
Integer factorization algorithms
Integer Factorization is an old problem in Number Theory, which has long been regarded as a fundamentally difficult problem. Since 1970, there have been substantial advances in integer factorization. A number of algorithms ... -
Large Scale Implementation Of The Block Lanczos Algorithm
(2010-08-16)Large sparse matrices arise in many applications, especially in the major problems of Cryptography of factoring integers and computing discrete logarithms. We focus attention on such matrices called sieve matrices generated ... -
Network Centrality Measures And Their Applications
(2014-03-03)Study of complex networks by researchers from many disciplines has provided penetrating insights on various complex systems. A study of the world wide web from a network theoretic perspective has led to the design of new ... -
New Approaches And Experimental Studies On - Alegebraic Attacks On Stream Ciphers
(2015-02-05)Algebraic attacks constitute an effective class of cryptanalytic attacks which have come up recently. In algebraic attacks, the relations between the input, output and the key are expressed as a system of equations and ... -
Number Theoretic, Computational and Cryptographic Aspects of a Certain Sequence of Arithmetic Progressions
(2018-06-21)This thesis introduces a new mathematical object: collection of arithmetic progressions with elements satisfying the inverse property, \j-th terms of i-th and (i+1)-th progressions are multiplicative inverses of each other ... -
On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem
(2013-05-21)There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led ...