2 resultados para bare public-key model
em AMS Tesi di Laurea - Alm@DL - Università di Bologna
Resumo:
Three structural typologies has been evaluated based on the nonlinear dynamic analysis (i.e. Newmark's methods for MDFs: average acceleration method with Modified Newton-Raphson iteration). Those structural typologies differ each other only for the infills presence and placement. In particular, with the term BARE FRAME: the model of the structure has two identical frames, arranged in parallel. This model constitutes the base for the generation of the other two typologies, through the addition of non-bearing walls. Whereas with the term INFILLED FRAME: the model is achieved by adding twelve infill panels, all placed in the same frame. Finally with the term PILOTIS: the model has been generated to represent structures where the first floor has no walls. Therefore the infills are positioned in only one frame in its three upper floors. All three models have been subjected to ten accelerograms using the software DRAIN 2000.
Resumo:
One of the main practical implications of quantum mechanical theory is quantum computing, and therefore the quantum computer. Quantum computing (for example, with Shor’s algorithm) challenges the computational hardness assumptions, such as the factoring problem and the discrete logarithm problem, that anchor the safety of cryptosystems. So the scientific community is studying how to defend cryptography; there are two defense strategies: the quantum cryptography (which involves the use of quantum cryptographic algorithms on quantum computers) and the post-quantum cryptography (based on classical cryptographic algorithms, but resistant to quantum computers). For example, National Institute of Standards and Technology (NIST) is collecting and standardizing the post-quantum ciphers, as it established DES and AES as symmetric cipher standards, in the past. In this thesis an introduction on quantum mechanics was given, in order to be able to talk about quantum computing and to analyze Shor’s algorithm. The differences between quantum and post-quantum cryptography were then analyzed. Subsequently the focus was given to the mathematical problems assumed to be resistant to quantum computers. To conclude, post-quantum digital signature cryptographic algorithms selected by NIST were studied and compared in order to apply them in today’s life.