Vienas iš svarbiausių šiuolaikinės kriptografijos uždavinių yra saugių vienkrypčių funkcijų paieška. Dabartiniai mokslininkai skiria šiam klausimui ypatingą demėsį. Šiame darbe yra nagrinėjama viena iš naujausių vienkrypčių funkcijų – matricinio laipsnio funkcija. Ši funkcija yra panaudota netiesinės algebrinės lygčių sistemos sudarymui. Pagrindinis demėsys darbe yra skirtas šios lygčių sistemos analizei bei jos praktiniam taikymui. Nustatysime ar matricinio laipsnio funkcija gali būti panaudota kriptografijoje. Taip pat nustatysime lygčių sistemos sprendinių skaičiaus priklausomybę nuo jos parametrų: matricų eilės m bei grupės Z_p parametro p. / Since the introduction of Diffie-Hellman key agreement protocol in 1976 computer technology has made a giant step forward. Nowadays there is not much time left before quantum computers will be in every home. However it was theoretically proven that discrete logarithm problem which is the basis for Diffie-Hellman protocol could be solved in polynomial time using such computers. Such possibility would make D-H protocol insecure. Thus cryptologists are searching for different ways to improve the security of the protocol by using hard problems. One of the ways to do so is to introduce secure one-way functions (OWF). In this paper a new kind of OWF called the matrix power function will be analyzed. Professor Eligijus Sakalauskas introduced this function in 2007 and later used this function to construct a Diffie-Hellman type key agreement protocol using square matrices. This protocol is not only based on matrix power function but also on commutative matrices which are defined in finite fields or rings. Thus an algebraic non-linear system of equations is formed. The security of this system will be analyzed. It will be shown that we can use matrix power function in cryptography. We will also be analyzing how does the solution of the system depend on system parameters: the order of matrices and a parameter p which defines a finite group Z_p. We will also briefly discuss the usage of this system in real life and the algebraic properties of the suggested OWF.

L’application du concept de synchronisation appliqué aux composants photoniques non-linéaires a permis l’avènement des communications chaotiques optiques. Les systèmes optoélectronique dans ces chaines de transmission ont déjà démontré leur potentiel en termes de sécurité additionnelle au niveau de la couche physique des réseaux optiques. Cependant, la quantification du niveau de sécurité et l’absence d’un cadre déduit aux aspects multi-utilisateurs (techniques de multiplexage spécifiques) ont fortement freiné le déploiement de ces techniques à large échelle. La recherche effectuée dans le cadre de cette thèse a contribué à l’avancement de ces deux questions ouvertes. Dans premier temps, nous nous sommes intéressés à la sécurité d’une classe de générateur optique particulière: les lasers à semi-conducteur à cavité externe (ECSL). Nous proposons d’attaquer le système dans le contexte le plus difficile, celui dans lequel aucune information n’est a priori disponible. La sortie du laser chaotique (l’intensité optique) est enregistrée, et les séries temporelles obtenues sont analysées. La sécurité est comprise dans ce contexte comme étant la quantité d’information sur les paramètres du système (analogue d’une clé dans les systèmes de cryptage conventionnels) et/ou la fonction non-linéaire du système (l’équivalent de l’algorithme de cryptage). Un ECSL est un système possédant un délai (aussi appelé retard), un paramètre critique pour la sécurité. Nous avons étudié l’influence des paramètres ajustable de l’ECSL chaotique sur l’identification du délai: l’intensité de la rétroaction optique, la valeur du délai, et le courant alimentant le laser (aussi appelé courant de pompe). Dans un deuxième temps nous interprétons ces résultats sur la base des régimes dynamiques précédent l’apparition du chaos dans l’ECSL. Nous avons proposé par la suite une architecture pour multiplexer des signaux chaotiques optiques générés par des ECSL. Nous démontrons la supériorité de cette approche en terme d’efficacité spectrale relativement aux méthodes de multiplexage en longueur d’onde (wavelength division multiplexing, WDM) appliquées aux communications optiques par chaos (aussi connues sous le nom de chaotic WDM ). Nous avons adapté un concept fondamental de la théorie de la synchronisation: la décomposition active-passive (APD) en utilisant des composants optiques simples. Nous démontrons la possibilité de multiplexer et démultiplexage de deux signaux chaotiques optiques par synchronisation (en utilisant deux émetteurs et deux récepteurs). Les performances et la robustesse de cette structure sont analysées ainsi que la possibilité de crypter et de décrypter des messages. Après cela, nous avons utilisé une classe de systèmes optoélectroniques différente de celle correspondant au deux premières sections, avec l’objectif d’utiliser un seul oscillateur chaotique pour encoder plusieurs messages au lieu de considérer un oscillateur par message. A cette fin, nous avons modifié une structure d’un générateur de chaos électro-optique existant dans la littérature en lui ajoutant plusieurs boucles de rétroactions non-linéaires. Chacune d’elle est utilisée pour l’encryptage d’un message, réalisée, par exemple, par la modulation du gain non-linéaire de la boucle. Nous avons analysé différentes configurations possibles, ainsi que les propriétés des signaux chaotiques générés au sein de chaque boucle et utilisés pour transporter les différents messages. Nous avons expliqué dans quelle mesure l’orthogonalité (ou décorrélation) entre les différents signaux peut être utilisée à notre avantage pour dériver des équations de décodage de faible complexité algorithmique (comme fonction du nombre d’utilisateurs). Enfin, nous analysons comment certains phénomènes d’interférences entre signaux porteurs peuvent être pris en compte afin de toujours permettre la récupération des messages. / With the rapid development of optical communications and the increasing amount of data exchanged, it has become utterly important to provide effective architectures to protect sensitive data. The use of chaotic optoelectronic devices has already demonstrated great potential in terms of additional computational security at the physical layer of the optical network. However, the determination of the security level and the lack of a multi-user framework are two hurdles which have prevented their deployment on a large scale. In this thesis, we propose to address these two issues. First, we investigate the security of a widely used chaotic generator, the external cavity semiconductor laser (ECSL). This is a time-delay system known for providing complex and high-dimensional chaos, but with a low level of security regarding the identification of its most critical parameter, the time delay. We perform a detailed analysis of the influence of the ECSL parameters to devise how higher levels of security can be achieved and provide a physical interpretation of their origin. Second, we devise new architectures to multiplex optical chaotic signals and realize multi-user communications at high bit rates. We propose two different approaches exploiting known chaotic optoelectronic devices. The first one uses mutually coupled ECSL and extends typical chaos-based encryption strategies, such as chaos-shift keying (CSK) and chaos modulation (CMo). The second one uses an electro-optical oscillator (EOO) with multiple delayed feedback loops and aims first at transposing coded-division multiple access (CDMA) and then at developing novel strategies of encryption and decryption, when the time-delays of each feedback loop are time- dependent.

No contexto do mundo contemporâneo, os veículos automotores estão cada vez mais integrados ao cotidiano das pessoas, sendo mais de 1 bilhão deles circulando pelo mundo. Por serem controlados por motoristas, estão sujeitos a falhas decorrentes da inerente condição humana, ocasionando acidentes, mortes e outros prejuízos. O controle autônomo de veículos tem se apresentado como alternativa na busca de redução desses prejuízos, sendo utilizado nas mais diferentes abordagens, por distintas instituições ao redor do planeta. Deste modo, torna-se uma pauta fundamental para o estudo de sistemas de controle. Este trabalho, valendo-se da descrição matemática do comportamento veicular, busca o desenvolvimento e a implementação de um método eficiente de controle autônomo de veículos voltado, principalmente, para a modelagem em espaço de estados. Considerando que mudanças de marchas, principalmente em um cenário de dirigibilidade autônoma, são ações aleatórias, o objetivo desta dissertação é utilizar estratégias de controle baseadas em sistemas lineares sujeitos a saltos Markovianos. / In nowadays society, automobile vehicles are getting more and more integrated to people\'s daily activities, as there are more than 1 billion of them on the streets around the world. As they are controlled by drivers, vehicles are subjected to failures caused by human mistakes that lead to accidents, injuries and others. Autonomous vehicle control has shown itself to be an alternative in the pursuit of damage reduction, and it is applied by different institutions in many countries. Therefore, it is a main subject in the area of control systems. This paper, relying on mathematical descriptions of vehicle behavior, aims to develop and apply an efficient autonomous control method that takes into account state-space formulation. This goal will be achieved by the use of control strategies based on Markovian Jump Linear Systems that will describe the highly non-linear dynamics of the vehicle in different operation points.

Esta tese de doutorado aborda os projetos robustos de controle e estimativa de estados para Sistemas Lineares sujeitos a Saltos Markovianos (SLSM) de tempo discreto sob a influência de incertezas paramétricas. Esses projetos são desenvolvidos por meio de extensões dos critérios quadráticos clássicos para SLSM nominais. Os critérios de custo quadrático para os SLSM incertos são formulados na forma de problemas de otimização min-max que permitem encontrar a melhor solução para o pior caso de incerteza (máxima influência de incerteza). Os projetos robustos correspondem às soluções ótimas obtidas por meio da combinação dos métodos de funções penalidade e mínimos quadrados regularizados robustos. Duas situações são investigadas: regular e estimar os estados quando os modos de operações são observados; e estimar os estados sob a hipótese de desconhecimento da cadeia de Markov. Estruturalmente, o regulador e as estimativas de estados assemelham-se às respectivas versões nominais. A recursividade é estabelecida em termos de equações de Riccati sem a necessidade de ajuste de parâmetros auxiliares e dependente apenas das matrizes de parâmetros e ponderações conhecidas. / This thesis deals with recursive robust designs of control and state estimates for discretetime Markovian Jump Linear Systems (MJLS) subject to parametric uncertainties. The designs are developed considering extensions of the standard quadratic cost criteria for MJLS without uncertainties. The quadratic cost criteria for uncertain MJLS are formulated in the form of min-max optimization problems to get the best solution for the worst uncertainty case. The optimal robust schemes correspond to the optimal solution obtained by the combination of penalty function and robust regularized least-squares methods. Two cases are investigated: to control and estimate the states when the operation modes are observed; and, to estimate the states when the Markov chain is unobserved. The optimal robust LQR and Kalman-type state estimates resemble the respective nominal versions. The recursiveness is established by Riccati equations in terms of parameter and weighting matrices previously known and without extra offline computations.

A designação de estruturas próprias de sistemas dinâmicos com retroação completa de estados ou saídas foi objeto de estudo de muitos pesquisadores durante a segunda metade do século XX. Os trabalhos mais relevantes sobre o tema foram revisados e serviram como base para a elaboração da metodologia apresentada neste trabalho. Que consiste na designação de estruturas próprias desejadas para um sistema linear em malha aberta com a modificação de parâmetros do sistema através da pseudo retroação de saídas devidamente definidas. O método foi aplicado na coxinização de um veículo de passeio. No qual os modos de vibrar de modelos lineares com 7 e 8 graus de liberdade do veículo foram adequados com o intuito de reduzir as acelerações verticais de chassi, características do fenômeno shake de motor e câmbio (faixa de frequência entre 7 e 25 Hz). Para tanto, reduziu-se a participação do grau de liberdade vertical de chassi nos modos com grande participação dos graus de liberdade de motor e massa não suspensa. Os resultados obtidos com a aplicação da metodologia na coxinização foram valores de rigidezes, amortecimentos e características de coxins hidráulicos que resultam na redução significativa da aceleração vertical de chassi, que implica em uma melhora perceptível para o consumidor na qualidade do conforto do veículo. / Eigenstructure assignment using full state or output feedback control had been object of study of many researchers during the second half of XX century. The most important works about eigenstructure assignment were reviewed, specially some applications within aerospace industry, that was the responsible for developing all the theory concerning pole and eigenvector placement. The review of the related theory was also based on the pioneering and most expressive works and were base for the methodology developed and described in this work. Which consists basically on the assignment of some desired eigensctructure of open loop linear systems modifying some parameters of the systems by means pseudo feedback of some outputs into inputs specifically defined. This methodology was applied to a 8 DOF vehicle model, a case of study, in order to adequate the system modes changing engine mounts parameters to improve the vehicle ride comfort, mainly eigenstructures about powertrain shake range frequencies.

Esta tese de doutorado aborda os projetos robustos de controle e estimativa de estados para Sistemas Lineares sujeitos a Saltos Markovianos (SLSM) de tempo discreto sob a influência de incertezas paramétricas. Esses projetos são desenvolvidos por meio de extensões dos critérios quadráticos clássicos para SLSM nominais. Os critérios de custo quadrático para os SLSM incertos são formulados na forma de problemas de otimização min-max que permitem encontrar a melhor solução para o pior caso de incerteza (máxima influência de incerteza). Os projetos robustos correspondem às soluções ótimas obtidas por meio da combinação dos métodos de funções penalidade e mínimos quadrados regularizados robustos. Duas situações são investigadas: regular e estimar os estados quando os modos de operações são observados; e estimar os estados sob a hipótese de desconhecimento da cadeia de Markov. Estruturalmente, o regulador e as estimativas de estados assemelham-se às respectivas versões nominais. A recursividade é estabelecida em termos de equações de Riccati sem a necessidade de ajuste de parâmetros auxiliares e dependente apenas das matrizes de parâmetros e ponderações conhecidas. / This thesis deals with recursive robust designs of control and state estimates for discretetime Markovian Jump Linear Systems (MJLS) subject to parametric uncertainties. The designs are developed considering extensions of the standard quadratic cost criteria for MJLS without uncertainties. The quadratic cost criteria for uncertain MJLS are formulated in the form of min-max optimization problems to get the best solution for the worst uncertainty case. The optimal robust schemes correspond to the optimal solution obtained by the combination of penalty function and robust regularized least-squares methods. Two cases are investigated: to control and estimate the states when the operation modes are observed; and, to estimate the states when the Markov chain is unobserved. The optimal robust LQR and Kalman-type state estimates resemble the respective nominal versions. The recursiveness is established by Riccati equations in terms of parameter and weighting matrices previously known and without extra offline computations.

Dans ce manuscrit, nous étudions le retard distribué et ses applications. Nous présentons la définition du retard distribué et l'étude de ses propriétés. Nous expliquons aussi le problème de la mise en œuvre du retard distribué et donnons une méthode générale pour son approximation. Ensuite nous présentons trois applications à l'aide de retard distribué, qui sont différentes avec les applications apparaissent dans la littérature. Le premier est l'inversion stable et le modèle appariement. Nous introduisons une nouvelle classe d'inversion stable et modèle d'appariement pour les systèmes linéaires de dimension finie invariables dans le temps. L'inversion stable (resp. modèle d'appariement) est une sorte d'inversion (resp. modèle d'appariement) de rapprochement. En fait, nous obtenons l'inversion exacte (resp. exacte modèle d'appariement) après un temps t = h, où le temps t = h peut être choisi arbitrairement. La deuxième application est le contrôle de la stabilité et du pôle placement finie pour une classe de système de dimension infinie. La dernière application du retard distribué est la synthèse de l'observateur pour l'estimation ou la commande de sortie. Nous craignons seulement avec les systèmes linéaires de dimension finie. Nous introduisons une boucle fermée observateurs sans mémoire par injection d'entrée. Convergence asymptotique ainsi que la convergence en temps fini de l'estimation sont analysés par injection de sortie et des informations d'entrée via retard distribué. Enfin, nous introduisons une nouvelle classe de l’approximation des systèmes à paramètres distribués. Nous travaillons sur la topologie du graphe, et montrons que sous certaines hypothèses faibles, une telle approximation peut être réalisé en utilisant retard distribué. / A distributed delay is a linear input-output operators and appears in many control problems. We investigate distributed delay and its applications. After introducing the definition and the main properties of the distributed delay, the numerical implementation problem of distributed delays is analyzed and a general method for its approximation is given. Then three applications are focused on where distributed delay appears. The first application is the stable inversion and model matching. A new class of stable inversion and model matching problem for finite dimensional linear time-invariant systems is defined. The stable inversion (resp. model matching) is an approximation of the inverse of a given model (resp. model matching), where exact inversion (resp. exact matching) is reached after a time $t=h$, which is a parameter of our procedure. The second application is concerned with stabilization and finite spectrum assignment for a class of infinite dimensional systems. The last application concerns observer synthesis for estimation or output control. For linear finite dimensional systems. A closed-loop memoryless observer by input injection is introduced. Asymptotic convergence as well as finite time convergence of the estimation are analyzed by output injection and input information via distributed delay. At last, we introduce a new class for approximation of distributed parameter systems. We work on the graph topology, and show that under some weak assumptions, such an approximation can be realized using distributed delay.

Cette thèse, centrée en Automatique, porte sur l’approximation de systèmes linéaires de dimension infinie en une dimension d’espace d’un point de vue entrée-sortie par une classe de systèmes à retards, et sur l’analyse de stabilité de cette classe d’approximation. Afin de conserver des propriétés du système de dimension infinie par interconnexion (stabilité, performance entrée-sortie), l’approximation est définie sur la topologie du graphe. Classiquement, les méthodes proposées par l’approximation conduisent à des modèles de dimension finie. Cependant, sur cette topologie du graphe, une telle approximation régie par des équations à paramètres localisés peut ne pas exister. On propose donc d’étendre cette classe d’approximation en y incluant l’opérateur retard. Nous obtenons alors un modèle d’équations différentielles couplées à des équations aux différences. L’existence et la mise en œuvre numérique de cette classe d’approximation et ses propriétés de réalisation d’état sont étudiées. Le deuxième enjeu de nos recherches s’est focalisé sur l’analyse de stabilité de cette classe d’approximation, par le biais de l’approche de Lyapunov-Krasovskii. Cette approche consiste à exploiter des conditions de stabilité sous forme d’un problème l’optimisation convexe. Cette analyse de stabilité est étendue au cas des systèmes avec paramètres incertains et des retards variants dans le temps pour la sous classe des équations aux différences. Nous développons également une estimation de la décroissance de la solution en vue de l’analyse de performance. L’analyse du conservatisme de la méthodologie proposée a été étudié. / This thesis addresses the approximation of infinite-dimensional linear systems for one-dimension in space, with the input-output approach, by a class of delay systems, and the stability analysis of this class of approximation. In order to preserve the properties of the original properties by interconnection, such as stability and/or input-output performance, the approximation is defined within the graph topology framework. In general, the methods proposed in the literature lead, by approximation, to finite-dimensional models. However, in this topology, such an approximation by lumped plants may not exist. It seems natural to generalize this approximation class by including a delay operator. We then obtain an approximation in the graph topology governed by a model of coupled differential-difference equations. The existence of this class of approximation and the properties of state-realization are studied. A constructive numerical method is proposed for this approximation. After the description of this class of approximation, we investigate stability of this class of operators, by the Lyapunov-Krasovskii approach. This approach consists to involve stability conditions of the form of a convex optimization problem. This stability analysis is extended to the case of systems with uncertain parameters and time-varying delays. We also propose estimates of the decay rate of the solution for the performance analysis. The analysis of the conservatism of the proposed methodology has been studied.

Made available in DSpace on 2014-06-11T19:22:18Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-02-25Bitstream added on 2014-06-13T20:28:17Z : No. of bitstreams: 1 arruda_rl_me_sjrp.pdf: 624072 bytes, checksum: 23ddd00e27d1ad781e2d1cec2cb65dee (MD5) / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / O objetivo principal deste trabalho é estudar o Teorema de Riemann-Roch, um dos resultados fundamentais na teoria de curvas algébricas, e apresentar algumas de suas aplicações. Este teorema é uma importante ferramenta para a classificação das curvas algébricas, pois relaciona propriedades algébricas e topológicas. Daremos uma descrição das curvas algébricas de gênero g, 1≤ g ≤ 5, e faremos um breve estudo dos pontos de inflexão de um sistema linear sobre uma curva algébrica / The main purpose of this work is to discuss The Riemann-Roch Theorem, wich is one of the most important results of the theory algebraic curves, and to present some applications. This theorem is an important tool of the classification of algebraic curves, sinces relates algebraic and topological properties. We will describle the algebraic curves of genus g, 1≤ g ≤ 5, and also study inflection points of a linear system on an algebraic curve

This thesis presents a comprehensive example framework on how current multiple model state estimation algorithms for jump Markov linear systems can be improved. The possible improvements are categorized as: -Design of multiple model state estimation algorithms using new criteria. -Improvements obtained using existing multiple model state estimation algorithms. In the first category, risk-sensitive estimation is proposed for jump Markov linear systems. Two types of cost functions namely, the instantaneous and cumulative cost functions related with risk-sensitive estimation are examined and for each one, the corresponding multiple model estate estimation algorithm is derived. For the cumulative cost function, the derivation involves the reference probability method where one defines and uses a new probability measure under which the involved processes has independence properties. The performance of the proposed risk-sensitive filters are illustrated and compared with conventional algorithms using simulations. The thesis addresses the second category of improvements by proposing -Two new online transition probability estimation schemes for jump Markov linear systems. -A mixed multiple model state estimation scheme which combines desirable properties of two different multiple model state estimation methods. The two online transition probability estimators proposed use the recursive Kullback-Leibler (RKL) procedure and the maximum likelihood (ML) criteria to derive the corresponding identification schemes. When used in state estimation, these methods result in an average error decrease in the root mean square (RMS) state estimation errors, which is proved using simulation studies. The mixed multiple model estimation procedure which utilizes the analysis of the single Gaussian approximation of Gaussian mixtures in Bayesian filtering, combines IMM (Interacting Multiple Model) filter and GPB2 (2nd Order Generalized Pseudo Bayesian) filter efficiently. The resulting algorithm reaches the performance of GPB2 with less Kalman filters.