Bibliografie tematiche / Cryptography / Tesi
Segui questo link per vedere altri tipi di pubblicazioni sul tema: Cryptography.

Tesi sul tema "Cryptography"

Autore: Grafiati
Pubblicato: 4 giugno 2021
Ultima modifica: 25 luglio 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Cryptography".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.

1

Poschmann, Axel York. "Lightweight cryptography cryptographic engineering for a pervasive world." Berlin Bochum Dülmen London Paris Europ. Univ.-Verl, 2009. http://d-nb.info/996578153/04.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Almeida, Braga Daniel de. "Cryptography in the wild : the security of cryptographic implementations." Thesis, Rennes 1, 2022. http://www.theses.fr/2022REN1S067.

Testo completo
Abstract (sommario):
Les attaques par canaux auxiliaire sont redoutables face aux implémentations cryptographiques. Malgré les attaques passées, et la prolifération d'outils de vérification, ces attaques affectent encore de nombreuses implémentations. Dans ce manuscrit, nous abordons deux aspects de cette problématique, centrés autour de l'attaque et de la défense. Nous avons dévoilé plusieurs attaques par canaux auxiliaires microarchitecturaux sur des implémentations de protocoles PAKE. En particulier, nous avons exposé des attaques sur Dragonfly, utilisé dans la nouvelle norme Wi-Fi WPA3, et SRP, déployé dans de
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Yerushalmi, Yoav. "Incremental cryptography." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42789.

Testo completo
Abstract (sommario):
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (leaves 147-148).<br>by Yoav Yerushalmi.<br>M.Eng.
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Shamonin, K. E. "Quantum cryptography." Thesis, Sumy State University, 2018. http://essuir.sumdu.edu.ua/handle/123456789/66837.

Testo completo
Abstract (sommario):
To advance most popular encryption algorithms such as public-key encryption and signature-based schemes, methods of quantum cryptography can be used. The main advantage of quantum cryptography is the fact it cannot be broken by any non-quantum computers and eavesdropping is impossible in quantum key distribution. Fundamental quantum mechanics is used in quantum key distribution to guarantee the safety of data transmitted. It is based on entangled pairs of photons in E91 protocol or photon polarization states in BB84 protocol.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Lopez, Samuel. "MODERN CRYPTOGRAPHY." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/729.

Testo completo
Abstract (sommario):
We live in an age where we willingly provide our social security number, credit card information, home address and countless other sensitive information over the Internet. Whether you are buying a phone case from Amazon, sending in an on-line job application, or logging into your on-line bank account, you trust that the sensitive data you enter is secure. As our technology and computing power become more sophisticated, so do the tools used by potential hackers to our information. In this paper, the underlying mathematics within ciphers will be looked at to understand the security of modern cip
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Minaud, Brice. "Analyse de primitives cryptographiques récentes." Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S066/document.

Testo completo
Abstract (sommario):
Dans cette thèse, nous nous intéressons à la sécurité de quelques primitives cryptographiques récentes, d’abord symétriques puis asymétriques, en passant par le modèle en boîte blanche, qui est à certains égards intermédiaire. Dans un premier temps, nous montrons l’existence de fonctions linéaires non triviales commutant avec la fonction de tour de certains chiffrements par bloc, dont découlent des attaques par auto-similarité et sous-espace invariant. Nous nous intéressons ensuite à la cryptanalyse de la structure ASASA, où deux couches non linéaires S sont imbriquées dans des couches affines
Gli stili APA, Harvard, Vancouver, ISO e altri
7

PRIYADHARSHINI, THIRUTHUVADOSS ANGELINE. "Comparison and Performance Evaluation of Modern Cryptography and DNA Cryptography." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-120103.

Testo completo
Abstract (sommario):
In this paper, a new cryptographic method called DNA cryptography and the already existing methods of modern cryptography are studied, implemented and results are obtained. Both these cryptographic method’s results are compared and analyzed to find out the better approach among the two methods. The comparison is done in the main aspects of process running time, key size, computational complexity and cryptographic strength. And the analysis is made to find the ways these above mentioned parameters are enhancing the respective cryptographic methods and the performance is evaluated. For compariso
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Nyman, Ellinor. "Cryptography : A study of modern cryptography and its mathematical methods." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-447460.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Idrees, Zunera. "Elliptic Curves Cryptography." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-17544.

Testo completo
Abstract (sommario):
In the thesis we study the elliptic curves and its use in cryptography. Elliptic curvesencompasses a vast area of mathematics. Elliptic curves have basics in group theory andnumber theory. The points on elliptic curve forms a group under the operation of addition.We study the structure of this group. We describe Hasse’s theorem to estimate the numberof points on the curve. We also discuss that the elliptic curve group may or may not becyclic over finite fields. Elliptic curves have applications in cryptography, we describe theapplication of elliptic curves for discrete logarithm problem and El
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Roe, Michael Robert. "Cryptography and evidence." Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627396.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
11

Vasudevan, Prashant Nalini. "Fine-grained cryptography." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120412.

Testo completo
Abstract (sommario):
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 167-180).<br>Fine-grained cryptography is the study of cryptographic objects that are required to be secure only against adversaries that are moderately more powerful than the honest parties. This weakening in security requirements opens up possibilities for meaningful cryptographic constructions in various settings using hardness assumptions that are considerably weaker than those used in
Gli stili APA, Harvard, Vancouver, ISO e altri
12

Dodis, Yevgeniy 1976. "Exposure-resilient cryptography." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86613.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
13

Золотова, Світлана Григорівна, Светлана Григорьевна Золотова, Svitlana Hryhorivna Zolotova, and M. Chernyakova. "History of cryptography." Thesis, Видавництво СумДУ, 2008. http://essuir.sumdu.edu.ua/handle/123456789/16061.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
14

Germouty, Paul. "Identity-based cryptography." Thesis, Limoges, 2018. http://www.theses.fr/2018LIMO0041/document.

Testo completo
Abstract (sommario):
Dans cette thèse nous étudions les possibilités que les chiffrements basés sur l’identité offrent quand ils sont utilisés dans un but différent qu’un simple chiffrement. Nous avons pu généraliser différents types de chiffrement basés sur l’identité en une nouvelle primitive nommé Downgradable Identity-based Encryption (DIBE). Nous avons trouvé un moyen générique de transformer de simple IBE en des IBE en blanc, dans le cas où l’IBE est affine nous rendons le coût de communication très faible (de linéaire à logarithmique). Ces deux primitives ont donné lieux à différentes applications : les chi
Gli stili APA, Harvard, Vancouver, ISO e altri
15

Pavlovski, Christopher John. "Applied batch cryptography." Thesis, Queensland University of Technology, 2000. https://eprints.qut.edu.au/36856/1/Christopher%20Pavlovski%20Thesis.pdf.

Testo completo
Abstract (sommario):
The material presented in this thesis may be viewed as comprising two key parts, the first part concerns batch cryptography specifically, whilst the second deals with how this form of cryptography may be applied to security related applications such as electronic cash for improving efficiency of the protocols. The objective of batch cryptography is to devise more efficient primitive cryptographic protocols. In general, these primitives make use of some property such as homomorphism to perform a computationally expensive operation on a collective input set. The idea is to amortise an expensi
Gli stili APA, Harvard, Vancouver, ISO e altri
16

Wen, Weiqiang. "Contributions to the hardness foundations of lattice-based cryptography." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEN070/document.

Testo completo
Abstract (sommario):
La cryptographie sur les réseaux est l’une des approches les plus compétitives pour protéger la confidentialité, dans les applications actuelles et l’ère post-quantique. Le problème central qui sert de fondement de complexité de la cryptographie sur réseaux est Learning with Errors (LWE). Il consiste à résoudre un système d’équations bruité, linéaire et surdéterminé. Ce problème est au moins aussi difficile que les problèmes standards portant sur les réseaux, tels que le décodage à distance bornée (BDD pour Bounded Distance Decoding) et le problème du vecteur le plus court unique (uSVP pour un
Gli stili APA, Harvard, Vancouver, ISO e altri
17

Kosek, Amy. "An Exploration of Mathematical Applications in Cryptography." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1428944810.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
18

Bultel, Xavier. "Mécanismes de délégation pour les primitives de cryptographie à clé publique." Thesis, Université Clermont Auvergne‎ (2017-2020), 2018. http://www.theses.fr/2018CLFAC100.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
19

Bisson, Gaetan. "Endomorphism Rings in Cryptography." Phd thesis, Institut National Polytechnique de Lorraine - INPL, 2011. http://tel.archives-ouvertes.fr/tel-00609211.

Testo completo
Abstract (sommario):
La cryptographie est devenue indispensable afin de garantir la sécurité et l'intégrité des données transitant dans les réseaux de communication modernes. Ces deux dernières décennies, des cryptosystèmes très efficaces, sûr et riches en fonctionnalités ont été construits à partir de variétés abéliennes définies sur des corps finis. Cette thèse contribue à certains aspects algorithmiques des variétés abéliennes ordinaires touchant à leurs anneaux d'endomorphismes. Cette structure joue un rôle capital dans la construction de variétés abéliennes ayant de bonnes propriétés. Par exemple, les couplag
Gli stili APA, Harvard, Vancouver, ISO e altri
20

Alexander, Nicholas Charles. "Algebraic Tori in Cryptography." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1154.

Testo completo
Abstract (sommario):
Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require significantly less bandwidth than conventional analogues. The systems we study, called torus-based cryptosystems, were analyzed by Karl Rubin and Alice Silverberg in 2003 [RS03]. They interpreted the XTR [LV00] and LUC [SL93] cryptosystems in terms of quotients of algebraic tori and birational parameterizations, and they also presented CEILIDH, a new torus-based cryptosystem. This thesis introduces
Gli stili APA, Harvard, Vancouver, ISO e altri
21

Déchène, Isabelle. "Generalized Jacobians in cryptography." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100347.

Testo completo
Abstract (sommario):
Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance. The study of such a candidate, the so-called generalized Jacobians, is the object of this dissertation. The motivation for this work came from the obs
Gli stili APA, Harvard, Vancouver, ISO e altri
22

Inamori, Hitoshi. "Security in quantum cryptography." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393459.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
23

Gray, Sean. "Quantum Entanglement and Cryptography." Thesis, Uppsala universitet, Teoretisk fysik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227085.

Testo completo
Abstract (sommario):
In this paper the features of quantum systems which lay the foundation of quantum entanglement are studied. General properties of entangled states are discussed, including their entropy and relation to Bell's inequality. Applications of entanglement, namely quantum teleportation and quantum cryptography, are also considered.
Gli stili APA, Harvard, Vancouver, ISO e altri
24

Park, Sunoo. "Cryptography for societal benefit." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118099.

Testo completo
Abstract (sommario):
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 331-349).<br>The deployment of cryptography in society has a range of effects that are not always evident when studying cryptography as a technological construct in isolation. This observation suggests a number of natural research directions that examine cryptography as an instrument of societal influence; that is, as a technological construct in conjunction with its societal effects. This
Gli stili APA, Harvard, Vancouver, ISO e altri
25

Fournier, Jacques Jean-Alain Michael. "Vector microprocessors for cryptography." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613318.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
26

Дядечко, Алла Миколаївна, Алла Николаевна Дядечко, Alla Mykolaivna Diadechko, and V. V. Kontchevich. "Security pitfalls in cryptography." Thesis, Видавництво СумДУ, 2010. http://essuir.sumdu.edu.ua/handle/123456789/18334.

Testo completo
Abstract (sommario):
A cryptographic system can only be as strong as the encryption algorithms, digital signature algorithms, one-way hash functions, and massage authentication codes it relies on. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/18334
Gli stili APA, Harvard, Vancouver, ISO e altri
27

Delman, Bethany. "Genetic algorithms in cryptography /." Link to online version, 2003. https://ritdml.rit.edu/dspace/handle/1850/263.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
28

Goldenberg, David. "Adaptive learning and cryptography." W&M ScholarWorks, 2010. https://scholarworks.wm.edu/etd/1539623564.

Testo completo
Abstract (sommario):
Significant links exist between cryptography and computational learning theory. Cryptographic functions are the usual method of demonstrating significant intractability results in computational learning theory as they can demonstrate that certain problems are hard in a representation independent sense. On the other hand, hard learning problems have been used to create efficient cryptographic protocols such as authentication schemes, pseudo-random permutations and functions, and even public key encryption schemes.;Learning theory / coding theory also impacts cryptography in that it enables cryp
Gli stili APA, Harvard, Vancouver, ISO e altri
29

Chakraborty, Kaushik. "Cryptography with spacetime constraints." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066194/document.

Testo completo
Abstract (sommario):
Dans cette thèse,nous étudions comment exploiter des contraintes spatio-temporelles,notamment le principe d'impossibilité de transmission supraluminique,dans le but de créer des primitives cryptographiques sûres,par exemple la vérification de position ou la "mise en gage de bit''(bit commitment). D'après le principe d'impossibilité de transmission supraluminique,aucun vecteur physique d'information ne peut voyager plus vite que la vitesse de la lumière. Ce principe entraîne une contrainte sur le temps de communication entre deux points éloignés. Ce délai dans le transfert d'information peut êt
Gli stili APA, Harvard, Vancouver, ISO e altri
30

Chakraborty, Kaushik. "Cryptography with spacetime constraints." Electronic Thesis or Diss., Paris 6, 2017. http://www.theses.fr/2017PA066194.

Testo completo
Abstract (sommario):
Dans cette thèse,nous étudions comment exploiter des contraintes spatio-temporelles,notamment le principe d'impossibilité de transmission supraluminique,dans le but de créer des primitives cryptographiques sûres,par exemple la vérification de position ou la "mise en gage de bit''(bit commitment). D'après le principe d'impossibilité de transmission supraluminique,aucun vecteur physique d'information ne peut voyager plus vite que la vitesse de la lumière. Ce principe entraîne une contrainte sur le temps de communication entre deux points éloignés. Ce délai dans le transfert d'information peut êt
Gli stili APA, Harvard, Vancouver, ISO e altri
31

Klembalski, Katharina. "Cryptography and number theory in the classroom -- Contribution of cryptography to mathematics teaching." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80390.

Testo completo
Abstract (sommario):
Cryptography fascinates people of all generations and is increasingly presented as an example for the relevance and application of the mathematical sciences. Indeed, many principles of modern cryptography can be described at a secondary school level. In this context, the mathematical background is often only sparingly shown. In the worst case, giving mathematics this character of a tool reduces the application of mathematical insights to the message ”cryptography contains math”. This paper examines the question as to what else cryptography can offer to mathematics education. Using the RSA cry
Gli stili APA, Harvard, Vancouver, ISO e altri
32

Rossi, Mélissa. "Extended security of lattice-based cryptography." Electronic Thesis or Diss., Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLE050.

Testo completo
Abstract (sommario):
La cryptographie fondée sur les réseaux euclidiens représente une alternative prometteuse à la cryptographie asymétrique utilisée actuellement, en raison de sa résistance présumée à un ordinateur quantique universel. Cette nouvelle famille de schémas asymétriques dispose de plusieurs atouts parmi lesquels de fortes garanties théoriques de sécurité, un large choix de primitives et, pour certains de ses représentants, des performances comparables aux standards actuels. Une campagne de standardisation post-quantique organisée par le NIST est en cours et plusieurs schémas utilisant des réseaux euc
Gli stili APA, Harvard, Vancouver, ISO e altri
33

Roux-Langlois, Adeline. "Lattice - Based Cryptography - Security Foundations and Constructions." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0940/document.

Testo completo
Abstract (sommario):
La cryptographie reposant sur les réseaux Euclidiens est une branche récente de la cryptographie dans laquelle la sécurité des primitives repose sur la difficulté présumée de certains problèmes bien connus dans les réseaux Euclidiens. Le principe de ces preuves est de montrer que réussir une attaque contre une primitive est au moins aussi difficile que de résoudre un problème particulier, comme le problème Learning With Errors (LWE) ou le problème Small Integer Solution (SIS). En montrant que ces problèmes sont au moins aussi difficiles à résoudre qu'un problème difficile portant sur les résea
Gli stili APA, Harvard, Vancouver, ISO e altri
34

Prest, Thomas. "Gaussian sampling in lattice-based cryptography." Thesis, Paris, Ecole normale supérieure, 2015. http://www.theses.fr/2015ENSU0045/document.

Testo completo
Abstract (sommario):
Bien que relativement récente, la cryptographie à base de réseaux euclidiens s’est distinguée sur de nombreux points, que ce soit par la richesse des constructions qu’elle permet, par sa résistance supposée à l’avènement des ordinateursquantiques ou par la rapidité dont elle fait preuve lorsqu’instanciée sur certaines classes de réseaux. Un des outils les plus puissants de la cryptographie sur les réseaux est le Gaussian sampling. À très haut niveau, il permet de prouver qu’on connaît une base particulière d’un réseau, et ce sans dévoiler la moindre information sur cette base. Il permet de réa
Gli stili APA, Harvard, Vancouver, ISO e altri
35

Scerri, Guillaume. "Proof of security protocols revisited." Thesis, Cachan, Ecole normale supérieure, 2015. http://www.theses.fr/2015DENS0002/document.

Testo completo
Abstract (sommario):
Avec la généralisation d'Internet, l'usage des protocoles cryptographiques est devenu omniprésent. Étant donné leur complexité et leur l'aspect critique, une vérification formelle des protocoles cryptographiques est nécessaire.Deux principaux modèles existent pour prouver les protocoles. Le modèle symbolique définit les capacités de l'attaquant comme un ensemble fixe de règles, tandis que le modèle calculatoire interdit seulement a l'attaquant derésoudre certain problèmes difficiles. Le modèle symbolique est très abstrait et permet généralement d'automatiser les preuves, tandis que le modèle c
Gli stili APA, Harvard, Vancouver, ISO e altri
36

Paindavoine, Marie. "Méthodes de calculs sur les données chiffrées." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1009/document.

Testo completo
Abstract (sommario):
L'annonce de l'essor du chiffrement des données se heurte à celle de l'avènement du "big data". Il n'est maintenant plus suffisant d'envoyer et de recevoir des données, il faut pouvoir les analyser, les exploiter ou encore les partager à grande échelle. Or, les données à protéger sont de plus en plus nombreuses, notamment avec la prise de conscience de l'impact qu'ont les nouvelles technologies (smartphones, internet of things, cloud,...) sur la vie privée des utilisateurs. En rendant ces données inaccessibles, le chiffrement bloque a priori les fonctionnalités auxquelles les utilisateurs et l
Gli stili APA, Harvard, Vancouver, ISO e altri
37

Makarov, Vadim. "Quantum cryptography and quantum cryptanalysis." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1473.

Testo completo
Abstract (sommario):
<p>This doctoral thesis summarizes research in quantum cryptography done at the Department of Electronics and Telecommunications at the Norwegian University of Science and Technology (NTNU) from 1998 through 2007.</p><p>The opening parts contain a brief introduction into quantum cryptography as well as an overview of all existing single photon detection techniques for visible and near infrared light. Then, our implementation of a fiber optic quantum key distribution (QKD) system is described. We employ a one-way phase coding scheme with a 1310 nm attenuated laser source and a polarization-main
Gli stili APA, Harvard, Vancouver, ISO e altri
38

Kirlar, Baris Bulent. "Elliptic Curve Pairing-based Cryptography." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612613/index.pdf.

Testo completo
Abstract (sommario):
In this thesis, we explore the pairing-based cryptography on elliptic curves from the theoretical and implementation point of view. In this respect, we first study so-called pairing-friendly elliptic curves used in pairing-based cryptography. We classify these curves according to their construction methods and study them in details. Inspired of the work of Koblitz and Menezes, we study the elliptic curves in the form $y^{2}=x^{3}-c$ over the prime field $F_{q}$ and compute explicitly the number of points $#E(mathbb{F}_{q})$. In particular, we show that the elliptic curve $y^{2}=x^{3}-1$ over
Gli stili APA, Harvard, Vancouver, ISO e altri
39

Lydersen, Lars Vincent van de Wiel. "Practical security of quantum cryptography." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13856.

Testo completo
Abstract (sommario):
The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography. Quantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography i
Gli stili APA, Harvard, Vancouver, ISO e altri
40

Muecke, Innes. "Greyscale and colour visual cryptography." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0017/MQ48283.pdf.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
41

Živić, Nataša. "Joint channel coding and cryptography." Aachen Shaker, 2007. http://d-nb.info/99003707X/04.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
42

Weir, J. P. "Visual cryptography and its applications." Thesis, Queen's University Belfast, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.557852.

Testo completo
Abstract (sommario):
" In this thesis, a number of new schemes are presented which address current problems and shortcomings within the area of visual cryptography. Visual cryptography provides a very powerful means by which a secret, in the form of a digital image, can be distributed (encoded) into two or more pieces known as shares. When these shares are xeroxed onto transparencies and superimposed exactly together, the original secret can be recovered (decoded) without the necessity for computation. Traditionally, visual cryptography allows effective and efficient sharing of a single secret between a number of
Gli stili APA, Harvard, Vancouver, ISO e altri
43

Grundy, Dan. "Concepts and calculation in cryptography." Thesis, University of Kent, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.498823.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
44

Longrigg, Jonathan James. "Aspects of Braid group cryptography." Thesis, University of Newcastle Upon Tyne, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492947.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
45

Miller, Justin C. "The security of quantum cryptography." Honors in the Major Thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/340.

Testo completo
Abstract (sommario):
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.<br>Bachelors<br>Arts and Sciences<br>Mathematics
Gli stili APA, Harvard, Vancouver, ISO e altri
46

Lütkenhaus, Norbert. "Generalised measurements and quantum cryptography." Thesis, University of Strathclyde, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443856.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
47

Hutchinson, Aaron. "Algorithms in Elliptic Curve Cryptography." Thesis, Florida Atlantic University, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10980188.

Testo completo
Abstract (sommario):
<p> Elliptic curves have played a large role in modern cryptography. Most notably, the Elliptic Curve Digital Signature Algorithm (ECDSA) and the Elliptic Curve Diffie-Hellman (ECDH) key exchange algorithm are widely used in practice today for their efficiency and small key sizes. More recently, the Supersingular Isogeny-based Diffie-Hellman (SIDH) algorithm provides a method of exchanging keys which is conjectured to be secure in the post-quantum setting. For ECDSA and ECDH, efficient and secure algorithms for scalar multiplication of points are necessary for modern use of these protocols. Li
Gli stili APA, Harvard, Vancouver, ISO e altri
48

Ozturk, Erdinc. "Low Power Elliptic Curve Cryptography." Digital WPI, 2005. https://digitalcommons.wpi.edu/etd-theses/691.

Testo completo
Abstract (sommario):
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm and lends itself to efficient hardware implementation due to its simplicity. Using the scaled modulus technique and our specialized inversion algorithm we develop an elliptic curve proce
Gli stili APA, Harvard, Vancouver, ISO e altri
49

Staffas, Rebecca. "Post-quantum Lattice-based Cryptography." Thesis, KTH, Matematik (Avd.), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-188022.

Testo completo
Abstract (sommario):
In a future full of quantum computers, new foundations for asymmetric cryptography are needed. We study the theoretical foundations for lattice-based cryptography as well as the current state on cryptographic attacks against them. We then turn our attention to signature systems and especially the system BLISS from 2013. We give an overview of the BLISS protocol and its security, and analyse its object sizes and resistance to attacks. We find that BLISS does not provide as high security as initially claimed. We then propose modifications to BLISS in order to allow for freer choices of dimension
Gli stili APA, Harvard, Vancouver, ISO e altri
50

Rudenko. "THE MAIN FEATURES OF CRYPTOGRAPHY." Thesis, Київ 2018, 2018. http://er.nau.edu.ua/handle/NAU/33893.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi di altri tipi di fonti sul tema "Cryptography":
Articoli di riviste Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia