Orientador: Júlio César Lopez Hernández / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-19T05:47:42Z (GMT). No. of bitstreams: 1 Aranha_DiegodeFreitas_D.pdf: 2545815 bytes, checksum: b630a80d0f8be161e6cb7519072882ed (MD5) Previous issue date: 2011 / Resumo: O advento da criptografia assimétrica ou de chave pública possibilitou a aplicação de criptografia em novos cenários, como assinaturas digitais e comércio eletrônico, tornando-a componente vital para o fornecimento de confidencialidade e autenticação em meios de comunicação. Dentre os métodos mais eficientes de criptografia assimétrica, a criptografia de curvas elípticas destaca-se pelos baixos requisitos de armazenamento para chaves e custo computacional para execução. A descoberta relativamente recente da criptografia baseada em emparelhamentos bilineares sobre curvas elípticas permitiu ainda sua flexibilização e a construção de sistemas criptográficos com propriedades inovadoras, como sistemas baseados em identidades e suas variantes. Porém, o custo computacional de criptossistemas baseados em emparelhamentos ainda permanece significativamente maior do que os assimétricos tradicionais, representando um obstáculo para sua adoção, especialmente em dispositivos com recursos limitados. As contribuições deste trabalho objetivam aprimorar o desempenho de criptossistemas baseados em curvas elípticas e emparelhamentos bilineares e consistem em: (i) implementação eficiente de corpos binários em arquiteturas embutidas de 8 bits (microcontroladores presentes em sensores sem fio); (ii) formulação eficiente de aritmética em corpos binários para conjuntos vetoriais de arquiteturas de 64 bits e famílias mais recentes de processadores desktop dotadas de suporte nativo à multiplicação em corpos binários; (iii) técnicas para implementação serial e paralela de curvas elípticas binárias e emparelhamentos bilineares simétricos e assimétricos definidos sobre corpos primos ou binários. Estas contribuições permitiram obter significativos ganhos de desempenho e, conseqüentemente, uma série de recordes de velocidade para o cálculo de diversos algoritmos criptográficos relevantes em arquiteturas modernas que vão de sistemas embarcados de 8 bits a processadores com 8 cores / Abstract: The development of asymmetric or public key cryptography made possible new applications of cryptography such as digital signatures and electronic commerce. Cryptography is now a vital component for providing confidentiality and authentication in communication infra-structures. Elliptic Curve Cryptography is among the most efficient public-key methods because of its low storage and computational requirements. The relatively recent advent of Pairing-Based Cryptography allowed the further construction of flexible and innovative cryptographic solutions like Identity-Based Cryptography and variants. However, the computational cost of pairing-based cryptosystems remains significantly higher than traditional public key cryptosystems and thus an important obstacle for adoption, specially in resource-constrained devices. The main contributions of this work aim to improve the performance of curve-based cryptosystems, consisting of: (i) efficient implementation of binary fields in 8-bit microcontrollers embedded in sensor network nodes; (ii) efficient formulation of binary field arithmetic in terms of vector instructions present in 64-bit architectures, and on the recently-introduced native support for binary field multiplication in the latest Intel microarchitecture families; (iii) techniques for serial and parallel implementation of binary elliptic curves and symmetric and asymmetric pairings defined over prime and binary fields. These contributions produced important performance improvements and, consequently, several speed records for computing relevant cryptographic algorithms in modern computer architectures ranging from embedded 8-bit microcontrollers to 8-core processors / Doutorado / Ciência da Computação / Doutor em Ciência da Computação

Disertační práce se zabývá kryptografickými protokoly poskytující ochranu soukromí, které jsou určeny pro zabezpečení komunikačních a informačních systémů tvořících heterogenní sítě. Práce se zaměřuje především na možnosti využití nekonvenčních kryptografických prostředků, které poskytují rozšířené bezpečnostní požadavky, jako je například ochrana soukromí uživatelů komunikačního systému. V práci je stanovena výpočetní náročnost kryptografických a matematických primitiv na různých zařízeních, které se podílí na zabezpečení heterogenní sítě. Hlavní cíle práce se zaměřují na návrh pokročilých kryptografických protokolů poskytujících ochranu soukromí. V práci jsou navrženy celkově tři protokoly, které využívají skupinových podpisů založených na bilineárním párování pro zajištění ochrany soukromí uživatelů. Tyto navržené protokoly zajišťují ochranu soukromí a nepopiratelnost po celou dobu datové komunikace spolu s autentizací a integritou přenášených zpráv. Pro navýšení výkonnosti navržených protokolů je využito optimalizačních technik, např. dávkového ověřování, tak aby protokoly byly praktické i pro heterogenní sítě.

Evaluating the safety of unreinforced concrete structures, such as concrete dams, requires an accurate prediction of cracking. Developing a suitable constitutive material model and a reliable computational procedure for analysing cracking processes in concrete has been a challenging and demanding task. Although many analytical methods based on fracture mechanics have been proposed for concrete dams in the last few decades, they have not yet become part of standard design procedures. Few of the current research findings are being implemented by practising engineers when evaluating dam safety. This research is focused on the development of a suitable crack modelling and analysis method for the prediction and study of fracturing in concrete gravity dams, and consequently, for the evaluation of dam safety against cracking. The research aims to contribute to the continuing research efforts into mastering the mechanics of cracking in concrete dams. An analytical method for the purpose of establishing a crack constitutive model and implementing the model for the fracture analysis of concrete structures, in particular massive concrete gravity dams under static loading conditions, has been developed, verified and applied in the safety evaluation of a concrete gravity dam. The constitutive material model is based on non-linear fracture mechanics and assumes a bilinear softening response. The crack model has various improved features: (1) an enhanced mode I bilinear strain-softening approach has been put forward; (2) a new formula for bilinear softening parameters has been developed and their relation with linear softening has been outlined; (3) the influence of bilinear softening parameters on the cracking response has been studied; and (4) an enhanced modification to the shear retention factor which depends on the crack normal strain is included. The material model has been incorporated into a finite element analysis using a smeared crack approach. A sub-program was specially coded for this research. The validity of the proposed cracking model and the computational procedure developed for the purpose of analyzing the tensile fracture behaviour of concrete structures has been confirmed by verification on various concrete structures, including beams, a dam model and actual gravity dams. The crack modelling technique developed was successfully used in evaluating the safety of an existing concrete gravity dam in South Africa and adequately predicted the cracking response of the dam structure under static loadings. The main conclusions drawn are as follows: <ul><li>Both mode I and mode II fracture have been modelled successfully.</li> <li>The proposed bilinear softening model remains relatively simple to implement but significantly improves on predicting the softening response of “small-scale” concrete structures.</li> <li>Both plane stress and plane strain crack analyses have been considered and can be confidently adopted in two-dimensional applications.</li> <li>The proposed method is mesh objective.</li> <li>The crack modelling method developed can correctly predict the crack propagation trajectory and the structural behaviour with regard to fracturing in concrete structures.</li> <li>If not considering shear stress concentration near the tip of a crack, constitutive crack analysis normally indicates a higher safety factor and a higher Imminent Failure Flood (IFF) than the classical methods in the analysis of concrete gravity dams for safety evaluation.</li></ul> / Thesis (PhD(Civil Engineering))--University of Pretoria, 2007. / Civil Engineering / PhD / unrestricted

In this master's thesis I'm engaged in problematic of texture mapping in ray tracing. Ray tracing is shortly described in the beginning. Texture mapping methods are described then, solid textures first and 2D textures follow. Implementation of MIP map method is deeply described in next chapters. The results are evaluated at the end.

Volumetric clouds are often used in video games in order to improve the realism or graphical quality of the game. However, in order to achieve real-time rendered clouds, optimizations have to be implemented as part of the rendering algorithm. These kinds of optimizations improve the performance, but can also have a negative impact on the visual quality of the clouds. This thesis investigates the use of bilinear interpolation for the purpose of improving the performance of a volumetric cloud renderer, while trying to avoid any substantial reduction in visual quality. This is extended by looking at the effect of adaptively sampling the pixel colors. The renderer itself is created in Unity3D using a ray marching algorithm. As part of the literature study, this research also explores different ways of measuring visual quality within real-time rendering. As a result of this, the thesis uses the Structural Similarity Index Measure to measure the visual quality. The research found that utilizing bilinear interpolation to ray march every eighth pixel results in a performance gain of 45%. However, it also reduces the visual quality of the volumetric clouds. This is counteracted by using adaptive sampling to interpolate only where the standard deviation of pixel colors is below a threshold. We cannot, however, determine the optimal value of this parameter, since it depends on the requirements of the renderer. Instead, it has to be determined on a case-by-case basis. / Volymetriska moln används i spel för att uppnå realism och förbättra den grafiska kvaliteten. Men för att uppnå realtidsrendering så måste optimeringar göras. Dessa typer av optimeringar förbättrar prestandan av programmet, men kan också försämra den visuella kvalteten. Den här studien undersöker hur en optimering baserad på bilinjär interpolering kan användas för att förbättra prestandan av volymetriska moln, utan att försämra den visuella kvaliteten i någon större utsträckning. Studien tittar även på hur adaptiv sampling av pixlarna påverkar optimeringen. För att utföra detta renderas molnen i Unity3D med hjälp av en ray marching-algoritm. Som del av litteraturstudien utforskas även olika sätt att evaluera visuell kvalitet inom realtidsrendering. Utifrån denna använder studien måttet Structural Similarity Index Measure för att mäta visuell kvalitet. Studien fann att den bilinjära interpoleringen resulterade i att prestandan ökade med 45% när endast var åttonde pixel är beräknad med ray marching, och resten interpoleras. Dock reduceras även den visuella kvaliteten av molnen. Detta kan motverkas med hjälp av adaptiv sampling. Då interpoleras endast pixlar där standardavvikelsen av de kringliggande pixlarna är under ett fördefinierat värde. Vi kan däremot inte definiera ett universiellt optimalt värde på detta värde. Det beror på att det optimala värdet beror på kraven vi har på programmet. Dessa kan variera från program till program. Därför måste detta bestämmas individuellt för varje program.

In this study, we present two new frequency domain tests for testing the Gaussianity and linearity of a sixth-order stationary univariate time series. Both are two-stage tests. The first stage is a test for the Gaussianity of the series. Under Gaussianity, the estimated normalized bispectrum has an asymptotic chi-square distribution with two degrees of freedom. If Gaussianity is rejected, the test proceeds to the second stage, which tests for linearity. Under linearity, with non-Gaussian errors, the estimated normalized bispectrum has an asymptotic non-central chi-square distribution with two degrees of freedom and constant noncentrality parameter. If the process is nonlinear, the noncentrality parameter is nonconstant. At each stage, empirical distribution function (EDF) goodness-ofit (GOF) techniques are applied to the estimated normalized bispectrum by comparing the empirical CDF with the appropriate null asymptotic distribution. The two specific methods investigated are the Anderson-Darling and Cramer-von Mises tests. Under Gaussianity, the distribution is completely specified, and application is straight forward. However, if Gaussianity is rejected, the proposed application of the EDF tests involves a transformation to normality. The performance of the tests and a comparison of the EDF tests to existing time and frequency domain tests are investigated under a variety of circumstances through simulation. For illustration, the tests are applied to a number of data sets popular in the time series literature.

No description available.

No description available.

The main theme of this work is effectiveness and efficiency of Krylov subspace methods and Krylov subspace recycling. While solving long, slowly changing sequences of large linear systems, such as the ones that arise in engineering, there are many issues we need to consider if we want to make the process reliable (converging to a correct solution) and as fast as possible. This thesis is built on three main components. At first, we target bilinear and quadratic form estimation. Bilinear form $c^TA^{-1}b$ is often associated with long sequences of linear systems, especially in optimization problems. Thus, we devise algorithms that adapt cheap bilinear and quadratic form estimates for Krylov subspace recycling. In the second part, we develop a hybrid recycling method that is inspired by a complex CFD application. We aim to make the method robust and cheap at the same time. In the third part of the thesis, we optimize the implementation of Krylov subspace methods on Graphic Processing Units (GPUs). Since preconditioners based on incomplete matrix factorization (ILU, Cholesky) are very slow on the GPUs, we develop a preconditioner that is effective but well suited for GPU implementation. / Ph. D.

A criptografia de chave pública sem certificado (certificateless) é uma alternativa ao modelo convencional de criptografia assimétrica, pois a autenticação da chave pública ocorre implicitamente durante a execução dos protocolos, sem a necessidade de gerenciamento e distribuição de certificados digitais. Potencialmente reduz custos computacionais e o nível de segurança alcançado é maior quando comparado ao modelo baseado em identidade. Nesta tese de doutorado, modelos formais de segurança para acordo de chave com autenticação sem certificado são aprimorados visando dois objetivos paralelos: (1) aumentar o nível de confiança que usuários podem depositar na autoridade geradora de chaves secretas parciais e (2) viabilizar protocolos que sejam eficientes computacionalmente e com propriedades de segurança relevantes, dentre as quais se inclui resistência a ataques de adversários que têm total controle do canal de comunicação e que podem substituir chaves públicas de usuários por valores arbitrários. Para atestar que as melhorias efetuadas são praticáveis e possibilitam que os objetivos sejam alcançados, novos protocolos são propostos para o caso que envolve dois participantes na comunicação. Os protocolos são provados seguros, usando-se técnica de redução de problemas computacionais. / Certificateless public key cryptography is an alternative model to traditional asymmetric key cryptography, because the public key authentication occurs implicitly during a protocol run, with no need of digital certificates management and distribution. It has the potential to reduce computing costs, and it allows a higher security level than the one in the identity-based model. In this PhD thesis, formal security models for certificateless authenticated key agreement are improved with two independent objectives: (1) to increase the trust level for the partial secret key generating authority on which users rely, and (2) to enable computationally efficient protocols, with significant security properties, such as resistance against attacks from adversaries with full control of the communication channel, and from adversaries who are able to replace users\' public keys by any chosen value. In order to demonstrate that these improvements made are feasible and achieve the objectives, new protocols are proposed in the two-party case. These protocols are proved secure by using reduction techniques for provable security.