Cryptography is science of secure message transmission. Cryptanalysis is involved with breaking these encrypted messages. Both cryptography and cryptanalysis constitute together to form cryptology. Anonymity means namelessness i.e., the quality or state of being unknown while authenticity translates to the quality or condition of being authentic or genuine. Anonymity and authenticity are two different embodiments of personal secrecy. Modern power has increased in its capacity to designate individuals, due to which they find it inconvenient to continue communicating, remaining anonymous. In this thesis we are going to describe an anonymous system which consists of a number of entities which are anonymous and are communicating with each other without revealing their identity and at the same time maintaining their authenticity such that an anonymous entity(sayE1)will be able to verify that, the message it received from another anonymous entity(sayE2)subsequent to an initial message from E2, are in fact from E2 itself. Later when E2 tries to recommend a similar communication to E1 with another anonymous entity E3 in the system, E1 must be able to verify that recommendation, without E2 losing its authenticity of its communication with E1 to E3. This thesis is divided into four chapters. The first chapter is an introduction to cryptography, symmetric key cryptography and public key cryptography. It also summarizes the contribution of this thesis. The second chapter gives various protocol for the above problem ’Anonymity with Authenticity’ along with its extension. Totally six protocols are proposed for the above problem. In third chapter all these six protocols are realized using four different schemes, where each scheme has its own pros and cons. The fourth and final chapter concludes with a note on what possible factors these four different realization schemes need to be chosen and other possible realization schemes.

The representer theorem from the reproducing kernel Hilbert space theory is the origin of many kernel-based machine learning and signal modelling techniques that are popular today. Most kernel functions used in practical applications behave in a homogeneous manner across the domain of the signal of interest, and they are called stationary kernels. One open problem in the literature is the specification of a non-stationary kernel that is computationally tractable. Some recent works solve large-scale optimization problems to obtain such kernels, and they often suffer from non-identifiability issues in their optimization problem formulation. Many practical problems can benefit from using application-specific prior knowledge on the signal of interest. For example, if one can adequately encode the prior assumption that edge contours are smooth, one does not need to learn a finite-dimensional dictionary from a database of sampled image patches that each contains a circular object in order to up-convert images that contain circular edges. In the first portion of this thesis, we present a novel method for constructing non-stationary kernels that incorporates prior knowledge. A theorem is presented that ensures the result of this construction yields a symmetric and positive-definite kernel function. This construction does not require one to solve any non-identifiable optimization problems. It does require one to manually design some portions of the kernel while deferring the specification of the remaining portions to when an observation of the signal is available. In this sense, the resultant kernel is adaptive to the data observed. We give two examples of this construction technique via the grayscale image up-conversion task where we chose to incorporate the prior assumption that edge contours are smooth. Both examples use a novel local analysis algorithm that summarizes the p-most dominant directions for a given grayscale image patch. The non-stationary properties of these two types of kernels are empirically demonstrated on the Kodak image database that is popular within the image processing research community. Tensors and tensor decomposition methods are gaining popularity in the signal processing and machine learning literature, and most of the recently proposed tensor decomposition methods are based on the tensor power and alternating least-squares algorithms, which were both originally devised over a decade ago. The algebraic approach for the canonical polyadic (CP) symmetric tensor decomposition problem is an exception. This approach exploits the bijective relationship between symmetric tensors and homogeneous polynomials. The solution of a CP symmetric tensor decomposition problem is a set of p rank-one tensors, where p is fixed. In this thesis, we refer to such a set of tensors as a rank-one decomposition with cardinality p. Existing works show that the CP symmetric tensor decomposition problem is non-unique in the general case, so there is no bijective mapping between a rank-one decomposition and a symmetric tensor. However, a proposition in this thesis shows that a particular space of rank-one decompositions, SE, is isomorphic to a space of moment matrices that are called quasi-Hankel matrices in the literature. Optimization over Riemannian manifolds is an area of optimization literature that is also gaining popularity within the signal processing and machine learning community. Under some settings, one can formulate optimization problems over differentiable manifolds where each point is an equivalence class. Such manifolds are called quotient manifolds. This type of formulation can reduce or eliminate some of the sources of non-identifiability issues for certain optimization problems. An example is the learning of a basis for a subspace by formulating the solution space as a type of quotient manifold called the Grassmann manifold, while the conventional formulation is to optimize over a space of full column rank matrices. The second portion of this thesis is about the development of a general-purpose numerical optimization framework over SE. A general-purpose numerical optimizer can solve different approximations or regularized versions of the CP decomposition problem, and they can be applied to tensor-related applications that do not use a tensor decomposition formulation. The proposed optimizer uses many concepts from the Riemannian optimization literature. We present a novel formulation of SE as an embedded differentiable submanifold of the space of real-valued matrices with full column rank, and as a quotient manifold. Riemannian manifold structures and tangent space projectors are derived as well. The CP symmetric tensor decomposition problem is used to empirically demonstrate that the proposed scheme is indeed a numerical optimization framework over SE. Future investigations will concentrate on extending the proposed optimization framework to handle decompositions that correspond to non-symmetric tensors.

This thesis demonstrates an alternative, concise but informative, method for representing group elements, which will prove particularly useful for the sporadic groups. It explains the theory behind symmetric presentations, and describes the algorithm for working with elements represented in this manner.

Le sujet principal de ce mémoire est le comportement asymptotique de la géométrie et topologie des variétés localement symétriques Gamma\ X quand le volume tend vers l’infini. Notre premier résultat porte sur la convergence Benjamini-Schramm des 2 ou 3-variétés hyperboliques arithmétiques. Une suite d'espaces localement symétriques (Gamma_n\ X) converge Benjamini-Schramm vers l'espace symétrique X si pour chaque R>0 la limite de \Vol((\Gamma\X)_{<R})/Vol(\Gamma\bs X). On montre qu'il existe une constante réelle C=C_R satisfaisant la propriété suivante: pour chaque réseau arithmétique de congruence Gamma de \PGL(2,R) ou PGL(2,C) sans torsion on a Vol ((Gamma\ X)_{<R})<= C_R \ Vol (Gamma\ X)^0.986. Il n'y a qu'un nombre fini de réseaux arithmétiques de covolume borné par une constante donc ce résultat implique la convergence Benjamini-Schramm pour des variétés arithmétiques de congruence. On donne aussi une version de (\ref{AbsFr1}) un peu plus faible qui reste vraie pour des réseaux arithmétiques qui ne sont pas de congruence. Les majorations de volume de la partie $R$-mince sont déduites d'une version forte de la propriété de la multiplicité limite satisfaite par les réseaux arithmétiques de PGL(2,R) et PGL(2,C). En utilisant nos résultats on confirme la conjecture de Gelander pour des 3-variétés arithmétiques hyperboliques: pour chaque telle variété M on construit un complexe simplicial N homotope à M dont le nombre des simplexes est O(Vol(M)) et le degré des nœuds est uniformément borné par une constante absolue. Dans la deuxième partie on s'intéresse aux espaces localement symétriques Gamma\X où X est de rang supérieur ou égal à 2. Notre résultat principal affirme que la dimension du premier groupe d'homologie à coefficients dans F_2 (corps avec 2 éléments) est sous-linéaire en le volume. Ce résultat est à comparer avec des travaux de Calegari et Emerton sur la cohomologie mod-p dans les tours p-adiques des 3-variétés et les résultats d'Abert, Gelander et Nikolov sur le rang des sous-groupes d'un réseau de rang supérieur à angles droits. Le point fort de notre approche est qu'il n'y a pas besoin de travailler dans une seule classe de commensurabilité. La troisième partie est indépendante des deux premières. Elle porte sur une extension du théorème de Kesten. Le théorème de Kesten affirme que si Gamma est un groupe engendré par un ensemble fini symétrique S, N est un sous-groupe normal de Gamma alors N est moyennable si et seulement si les rayons spectraux du graphe de Cayley Cay(Gamma,S) et du graphe de Scheier Sch(Gamma/N,S) coïncident. En utilisant les techniques de Abert, Glasner et Virag on généralise le theorème de Kesten aux N-uniformément récurrents. / The main theme of this work is the study of geometry and topology of locally symmetric spaces Gamma\ X as ther volume Vol(\Gamma\ X) tends to infinity. Our first main result concerns the Benjamini-Schramm convergence for arithmetic hyperbolic 2 or 3-manifolds. A sequence of locally symmetric spaces (Gamma_n\ X) converges Benjamini-Schramm to X if and only if for every radius R>0 the limit Vol((Gamma\ X)_{<R}/Vol (Gamma\ X) as n goes to infinity is 0, where (\Gamma\X)_{<R} stands for the R-thin part of Gamma\ X. We prove that there exists a positive constant C=C_R with the following property: for every torsion free, uniform, congruence arithmetic lattice Gamma in PGL(2,R) or PGL(2,C) Vol ((Gamma\ X)_{<R})<= C Vol (Gamma\X))^0.986. There is only finitely many arithmetic lattices of covolume bounded by a constant so the result above implies the Benjamini-Schramm convergence for any sequence of congruence arithmetic hyperbolic 3-manifolds. We also prove a similar but slightly weaker inequality for non-congruence subgroups. Our results are deduced form a strong form of the limit multiplicity property that holds for arithmetic lattices in PGL(2,R) of PGL(2,C). As an application of our bounds we confirm Gelander's conjecture on the triangulations of arithmetic hyperbolic 3-manifolds: we show that every arithmetic hyperbolic 3-manifold M admits a triangulation with O(Vol(M)) simplices and degrees of vertices bounded uniformly by an absolute constant. Next, we move to the setting of higher rank locally symmetric spaces. Let M_n=Gamma_n\ X be a sequence of pairwise distinct locally symmetric spaces modeled after a higher rank symmetric space X. We show that the dimension of the first homology group with coefficients in F_2 is sublinear in volume. This can be compared with the results of Calegari and Emerton on mod-p homology growth in p-adic analytic towers of 3-manifolds as well as the results of Abert, Gelander and Nikolov on the rank gradient of right-angled lattices in higher rank Lie groups.The main strength of our theorem is that we do not need to assume that the manifolds in question are commensurable. Our third result is independent of the first two. Kesten theorem asserts that if Gamma is group generated by a finite symmetric set S and N is a normal subgroup of Gamma then N is amenable if and only if the spectral radii of the Cayley graphs Cay(Gamma, S) and the Schreier graph Sch(Gamma/N,S) are equal. Building on the work of Abert, Glasner and Virag we extend Kesten's theorem to uniformly recurrent subgroups.

In this paper we develop new preconditioned iterative methods for solving monotone nonlinear eigenvalue problems. We investigate the convergence and derive grid-independent error estimates for these methods. Numerical experiments demonstrate the practical effectiveness of the proposed methods for a model problem.

In recent times the usage of smart phones has significantly increased. Businesses are transforming to make more out of smart phones. As a consequence, there is an increasing demand to have more and more mobile applications. Among other areas, mobile applications are also being used to make financial transactions. Applications used for financial transactions need to be more reliable and have end-to-end security. To implement security we heavily depend on cryptography and the heart of cryptography is the keys which are used in cryptographic processes (encryption/decryption). Therefore, it is essential not only to protect, but also to properly manage these keys, so that a robust and secure system can be achieved. This research work provides a complete implementation of symmetric key management for mobile phone applications with a focus on financial data using a key hierarchy approach. We have developed a key management system which allows smart phones to download the cryptographic key hierarchy. This key hierarchy is used to encrypt and decrypt financial data, such as PIN and other transaction information. Using this application (key management system), we can achieve an end-to-end security between client (mobile phones) and payment server (banking server). This research work presents implementation of key management system for Android OS only.

<div>In spatio-temporal data analysis, the problem of non-separable space-time covariance functions is important and hard to deal with. Most of the famous constructions of these covariance functions are fully symmetric, which is inappropriate in many spatiotemporal processes. The Non-Fully Symmetric Space-Time (NFSST) Matern model by Zhang, T. and Zhang, H. (2015) provides a way to construct a non-fully symmetric non-separable space-time correlation function from marginal spatial and temporal Matern correlation functions.</div><div>In this work we use the relationship between the spatial Matern and temporal Cauchy correlation functions and their spectral densities, and provide a modification to their Bochner’s representation by including a space-time interaction term. Thus we can construct a non-fully symmetric space-time Matern-Cauchy model, from any given marginal spatial Matern and marginal temporal Cauchy correlation functions. We are able to perform computation and parameter estimate on this family, using the Taylor expansion of the correlation functions. This model has attractive properties: it has much faster estimation compared with NFSST Matern model when the spatio-temporal data is large; it enables the existence of temporal long-range dependence (LRD), adding substantially to the flexibility of marginal correlation function in the time domain. Several spatio-temporal meteorological data sets are studied using our model, including one case with temporal LRD.</div>

Les travaux réalisés dans cette thèse ont pour objet l'analyse de la sécurité de chiffrements à clef secrète. Plus précisément, nous y décrivons la cryptanalyse de plusieurs chiffrements par blocs et à flot ayant pour point commun d'avoir été conçus récemment pour répondre aux nouveaux enjeux de la cryptographie symétrique. Nous mettons en avant des attaques des versions complètes de cinq chiffrements, prouvant ainsi que ces primitives cryptographiques n'apportent pas la sécurité annoncée par leurs concepteurs.La première partie de cette thèse est dédiée à l'analyse de chiffrements par blocs avec des techniques de cryptanalyse différentielle. Nous montrons comment mener une attaque par différentielles tronquées sur la famille de chiffrements à bas coût KLEIN en exploitant la faible diffusions de sa fonction de tour. Ensuite, nous nous intéressons à Zorro et à Picaro, deux chiffrements conçus de sorte à être faciles à protéger contre les attaques par canaux auxiliaires, et montrons que les choix de conception guidés par cette contrainte ont engendré des faiblesses dans leurs propriétés différentielles, pouvant ensuite être exploitées dans des attaques.La seconde partie du manuscrit porte sur la cryptanalyse de chiffrements à flot. Nous y étudions Sprout et Flip, deux chiffrements aux structures innovantes visant respectivement à limiter la taille du circuit matériel nécessaire à l'implémentation et une bonne adaptation dans un schéma de FHE. / The main subject of this thesis is the security analysis of symmetric key ciphers. Specifically, we study several recently proposed block and stream ciphers and prove that the level of security stated by their designers is overestimated. The ciphers we study were all designed in order to meet the needs of one of the new applications of symmetric cryptography, which include symmetric ciphers for very constrained environments.The first part of the thesis is dedicated to the analysis of block ciphers with techniques based on differential cryptanalysis. We start with the description of a truncated differential attack on the family of lightweight ciphers KLEIN. Next, we analyse two ciphers that were designed in such a way that they could be easily and effectively protected against side-channel attacks: Zorro and Picaro. We show that the design choices made by their designers lead to weak diffusion properties. We exploit these imperfections to devise a differential cryptanalysis of Zorro and a related key attack on Picaro.The second part of this thesis deals with stream ciphers and gives an analysis of two innovative designs: Sprout and Flip. Sprout was designed in order to limit its hardware area size and to suit very constrained environments, while Flip reaches efficient performances when used in FHE schemes. In both cases, we find flaws that lead to attacks of the particular set of parameters proposed for these ciphers.

Security protocols are used for establishing secure communication over insecure network. This document gives a brief introduction into description and formal specification in the area of security protocols design. It also includes description of the aplication library, its functions and methods how to use it.

The starting point of this paper is the observation that methods based on the direct match of keywords are inadequate because they do not consider the cognitive ability of concept formation and abstraction. We argue that keyword evaluation needs to be based on a semantic model of language capturing the semantic relatedness of words to satisfy the claim of the human-like ability of concept formation and abstraction and achieve better evaluation results. Evaluation of keywords is difficult since semantic informedness is required for this purpose. This model must be capable of identifying semantic relationships such as synonymy, hypernymy, hyponymy, and location-based abstraction. For example, when gathering texts from online sources, one usually finds a few keywords with each text. Still, these keyword sets are neither complete for the text nor are they in themselves closed, i.e., in most cases, the keywords are a random subset of all possible keywords and not that informative w.r.t. the complete keyword set. Therefore all algorithms based on this cannot achieve good evaluation results and provide good/better keywords or even a complete keyword set for a text. As a solution, we propose a word graph that captures all these semantic relationships for a given language. The problem with the hyponym/hyperonym relationship is that, unlike synonyms, it is not bidirectional. Thus the space of keyword sets requires a metric that is non-symmetric, in other words, a quasi-metric. We sketch such a metric that works on our graph. Since it is nearly impossible to obtain such a complete word graph for a language, we propose for the keyword task a simpler graph based on the base text upon which the keyword sets should be evaluated. This reduction is usually sufficient for evaluating keyword sets.