To see the other types of publications on this topic, follow the link: Message cryptography.

Dissertations / Theses on the topic 'Message cryptography'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 24 dissertations / theses for your research on the topic 'Message cryptography.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Ng, Yu Loon. "Short Message Service (SMS) security solution for mobile devices." Thesis, Monterey, Calif. : Naval Postgraduate School, 2006. http://bosun.nps.edu/uhtbin/hyperion.exe/06Dec%5FNg%5FYu.pdf.

Full text
Abstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, December 2006.<br>Thesis Advisor(s): Gurminder Singh, John Gibson. "December 2006." Includes bibliographical references (p. 91-94). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
2

Wainewright, Evelyn. "Efficient Simulation for Quantum Message Authentication." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35213.

Full text
Abstract:
A mix of physics, mathematics, and computer science, the study of quantum information seeks to understand and utilize the information that can be held in the state of a quantum system. Quantum cryptography is then the study of various cryptographic protocols on the information in a quantum system. One of the goals we may have is to verify the integrity of quantum data, a process called quantum message authentication. In this thesis, we consider two quantum message authentication schemes, the Clifford code and the trap code. While both of these codes have been previously proven secure, they hav
APA, Harvard, Vancouver, ISO, and other styles
3

Yuksel, Kaan. "Universal hashing for ultra-low-power cryptographic hardware applications." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0428104-195331.

Full text
Abstract:
Thesis (M.S.)--Worcester Polytechnic Institute.<br>Keywords: self-powered; universal hashing; ultra-low-power; message authentication codes; provable security. Includes bibliographical references (p. 55-61).
APA, Harvard, Vancouver, ISO, and other styles
4

Bansal, Tarun Kumar. "Designing generic asymmetric key cryptosystem with message paddings." Thesis, Queensland University of Technology, 2018. https://eprints.qut.edu.au/117071/1/Tarun%20Kumar_Bansal_Thesis.pdf.

Full text
Abstract:
This thesis focuses on structural remodelling and security proof of cryptographic schemes. A message pre-processing, also known as asymmetric message padding, is an essential step in asymmetric encryption which is heavily used in secure banking applications. In this thesis, we propose new effective padding schemes and able to mitigate the various computation and memory overhead compared to previous works. We are also able to provide streaming capability which was missing in most of the previous works. Mathematical security proof of proposed schemes justifies their security.
APA, Harvard, Vancouver, ISO, and other styles
5

Lo, Johnny Li-Chang. "A framework for cryptography algorithms on mobile devices." Diss., University of Pretoria, 2007. http://hdl.handle.net/2263/28849.

Full text
Abstract:
Mobile communication devices have become a popular tool for gathering and disseminating information and data. With the evidence of the growth of wireless technology and a need for more flexible, customizable and better-optimised security schemes, it is evident that connection-based security such as HTTPS may not be sufficient. In order to provide sufficient security at the application layer, developers need access to a cryptography package. Such packages are available as third party mobile cryptographic toolkits or are supported natively on the mobile device. Typically mobile cryptographic pac
APA, Harvard, Vancouver, ISO, and other styles
6

Khati, Louiza. "Full disk encryption and beyond." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEE047.

Full text
Abstract:
Cette thèse est dédiée à l’analyse de modes opératoires pour la protection des disques durs. Dans un premier temps, l’analyse des modes opératoires permettant de protéger la confidentialité des données est réalisée dans le modèle Full Disk Encryption (FDE). Ce modèle est très contraignant puisqu’il exclut tout mode qui ne conserve pas la longueur (la valeur en clair et chiffrée du secteur doivent avoir la même taille) et seuls des modes déterministes peuvent avoir cette propriété. Néanmoins, il est possible de tirer partie d’une valeur du système nommée le diversifiant, qui originellement a un
APA, Harvard, Vancouver, ISO, and other styles
7

Devulapalli, Venkata Lakshmi Narasimha. "Application of Huffman Data Compression Algorithm in Hashing Computation." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2614.

Full text
Abstract:
Cryptography is the art of protecting information by encrypting the original message into an unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of the text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by the hash function are called as the message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing [Thomsen and Knudsen, 2005]. The purp
APA, Harvard, Vancouver, ISO, and other styles
8

Cederlöf, Jörgen. "Authentication in quantum key growing." Thesis, Linköping University, Department of Mathematics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3214.

Full text
Abstract:
<p>Quantum key growing, often called quantum cryptography or quantum key distribution, is a method using some properties of quantum mechanics to create a secret shared cryptography key even if an eavesdropper has access to unlimited computational power. A vital but often neglected part of the method is unconditionally secure message authentication. This thesis examines the security aspects of authentication in quantum key growing. Important concepts are formalized as Python program source code, a comparison between quantum key growing and a classical system using trusted couriers is included,
APA, Harvard, Vancouver, ISO, and other styles
9

Kortelainen, T. (Tuomas). "On iteration-based security flaws in modern hash functions." Doctoral thesis, Oulun yliopisto, 2014. http://urn.fi/urn:isbn:9789526206431.

Full text
Abstract:
Abstract The design principles proposed independently by both Ralph Merkle and Ivan Damgård in 1989 are applied widely in hash functions that are used in practice. The construction reads the message in one message block at a time and applies iteratively a compression function that, given a single message block and a hash value, outputs a new hash value. This iterative structure has some security weaknesses. It is vulnerable, for instance, to Joux's multicollision attack, herding attack that uses diamond structures and Trojan message attack. Our principal research topic comprises the deficienci
APA, Harvard, Vancouver, ISO, and other styles
10

Tomaz, Antonio Emerson Barros. "Resgate de autoria em esquemas de assinatura em anel." reponame:Repositório Institucional da UFC, 2014. http://www.repositorio.ufc.br/handle/riufc/10842.

Full text
Abstract:
TOMAZ. A. E. B. Resgate de autoria em esquemas de assinatura em anel. 2014. 67 f. Dissertação (Mestrado em Engenharia de Teleinformática) - Centro de Tecnologia, Universidade Federal do Ceará, Fortaleza, 2014.<br>Submitted by Marlene Sousa (mmarlene@ufc.br) on 2015-02-27T18:29:04Z No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)<br>Approved for entry into archive by Marlene Sousa(mmarlene@ufc.br) on 2015-03-04T16:09:55Z (GMT) No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)<br>
APA, Harvard, Vancouver, ISO, and other styles
11

Kubilay, Murat Yasin. "Security On Mobile Phones With Lightweight Cryptographic Message Syntax." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608676/index.pdf.

Full text
Abstract:
Cryptographic Message Syntax (CMS) is a standard for protecting messages cryptographically. Using CMS, messages can be protected in different content types such as signed-data, enveloped-data, digested-data and authenticated-data. CMS is architected around certificate based key management and symmetric cryptography. In this thesis, a lightweight CMS envelope is proposed for the mobile phones which have limited memory and processing power, in order to provide the privacy of the data either stored on them or exchanged by means of multimedia messaging (MMS) and e-mail. A sample prototype is imple
APA, Harvard, Vancouver, ISO, and other styles
12

Oliveira, Bruno Trevizan de. "Arquitetura de segurança fim-a-fim para redes de sensores sem fio." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-21062013-120411/.

Full text
Abstract:
Diversas aplicações de redes de sensores sem fio necessitam de serviços de segurança, como confidencialidade, integridade e autenticação de origem de dados. Contudo, dadas as limitações de processamento, memória e suprimento de energia dos dispositivos, os mecanismos de segurança tradicionais podem causar efeitos indesejáveis na rede, como atraso na comunicação e aumento no consumo de energia, impondo obstáculos para seu uso na tecnologia em questão. Muitas propostas de esquemas de segurança baseados em criptografia simétrica projetados especificamente para redes de sensores sem fio são encont
APA, Harvard, Vancouver, ISO, and other styles
13

Poupard, Guillaume. "Authentification d'entites, de messages et de cles cryptographiques : theorie et pratique." Palaiseau, Ecole polytechnique, 2000. http://www.theses.fr/2000EPXX0021.

Full text
Abstract:
Le developpement fulgurant des nouveaux moyens de communication, symbolise par la democratisation de l'acces au reseau internet, laisse entrevoir de nombreuses nouvelles applications mais egalement une multiplication des possibilites de fraude. Le defi pose a la cryptologie moderne consiste a securiser cet environnement en proposant des outils permettant le chiffrement des communications mais egalement l'authentification d'entites, de messages et de cles cryptographiques. Dans cette these, nous abordons le probleme de l'identification des individus dans un univers numerique ou pour prouver son
APA, Harvard, Vancouver, ISO, and other styles
14

Junior, Marcos Antonio Simplício. "Algoritmos de autenticação de mensagens para redes de sensores." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-11082010-114456/.

Full text
Abstract:
Prover segurança às informações trafegadas nos mais diversos tipos de redes é algo essencial. Entretanto, redes altamente dependentes de dispositivos com recursos limitados (como sensores, tokens e smart cards) apresentam um desafio importante: a reduzida disponibilidade de memória e energia destes dispositivos, bem como sua baixa capacidade de processamento, dificultam a utilização de diversos algoritmos criptográficos considerados seguros atualmente. Este é o caso não apenas de cifras simétricas, que proveem confidencialidade aos dados, mas também de MACs (Message Authentication Code, ou Cód
APA, Harvard, Vancouver, ISO, and other styles
15

Huang, An-Lun. "Security primitives for ultra-low power sensor nodes in wireless sensor networks." Diss., University of Pretoria, 2007. http://hdl.handle.net/2263/24343.

Full text
Abstract:
The concept of wireless sensor network (WSN) is where tiny devices (sensor nodes), positioned fairly close to each other, are used for sensing and gathering data from its environment and exchange information through wireless connections between these nodes (e.g. sensor nodes distributed through out a bridge for monitoring the mechanical stress level of the bridge continuously). In order to easily deploy a relatively large quantity of sensor nodes, the sensor nodes are typically designed for low price and small size, thereby causing them to have very limited resources available (e.g. energy, pr
APA, Harvard, Vancouver, ISO, and other styles
16

Perin, Guilherme. "On the Resistance of RSA Countermeasures at Algorithmic, Arithmetic and Hardware Levels Against Chosen-Message, Correlation and Single-Execution Side-Channel Attacks." Thesis, Montpellier 2, 2014. http://www.theses.fr/2014MON20039/document.

Full text
Abstract:
De nos jours, les concepteurs de dispositifs cryptographiques doivent non seulement mettre en œuvre des algorithmes robustes, mais ils doivent également s'assurer qu'il n'y ait pas de fuites d'informations à travers plusieurs canaux latéraux lors de l'exécution d'un algorithme. En effet, si ce n'est pas le cas, les implémentations cryptographiques, tant symétriques qu'asymétriques, seront vulnérables aux attaques par canaux auxiliaires. Pour les algorithmes à clé publique tels que le RSA, l'opération principale que doit être rendue robuste est l'exponentiation modulaire sur un anneau fini. Les
APA, Harvard, Vancouver, ISO, and other styles
17

Mashatan, Atefeh. "Message Authentication and Recognition Protocols Using Two-Channel Cryptography." Thesis, 2008. http://hdl.handle.net/10012/4122.

Full text
Abstract:
We propose a formal model for non-interactive message authentication protocols (NIMAPs) using two channels and analyze all the attacks that can occur in this model. Further, we introduce the notion of hybrid-collision resistant (HCR) hash functions. This leads to a new proposal for a NIMAP based on HCR hash functions. This protocol is as efficient as the best previous NIMAP while having a very simple structure and not requiring any long strings to be authenticated ahead of time. We investigate interactive message authentication protocols (IMAPs) and propose a new IMAP, based on the existence
APA, Harvard, Vancouver, ISO, and other styles
18

Cai, Shan Zhi, and 蔡善智. "An Elliptic Curve Cryptography Algorithm Based On An Enhance Advanced Message Queuing Protocol." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/27429684435118794457.

Full text
Abstract:
碩士<br>國立交通大學<br>管理學院資訊管理學程<br>104<br>In recent years, with the rapid development of Internet, cross-platform communications with message-oriented middleware (message-oriented middleware) has become very widespread, ubiquitous, and the Internet in this popular issue, how to make smart mobile device heterogeneous platform to the service, to have information quickly and safely transfer function, will be an important research goal. Therefore, this paper uses Advanced Message Queuing Agreement (Advanced Message Queuing Protocol) as the basis for message passing, and with elliptic curve cryptography
APA, Harvard, Vancouver, ISO, and other styles
19

Hajiabadi, Mohammad. "Encryption security against key-dependent-message attacks: applications, realizations and separations." Thesis, 2016. http://hdl.handle.net/1828/7454.

Full text
Abstract:
In this thesis we study the notion of circular security for bit-encryption schemes. Informally speaking, a bit-encryption scheme is circular secure if it remains secure even if the key of the system is used to encrypt its own individual bits. This notion (or slight extensions thereof) has foundational applications, most notably in the context of fully-homomorphic encryption and amplification techniques for key dependent- message security. We explore the notion of circular security from three different perspectives, stemming from (1) assumptions sufficient to realize this notion, (2) m
APA, Harvard, Vancouver, ISO, and other styles
20

Χαράλαμπος, Μιχαήλ. "Κώδικες πιστοποίησης μηνυμάτων : σχεδιασμός και υλοποιήσεις σε πλατφόρμες υλικού και συγκριτικές αποτιμήσεις". Thesis, 2010. http://nemertes.lis.upatras.gr/jspui/handle/10889/4410.

Full text
Abstract:
Σε αυτή τη μεταπτυχιακή διπλωματική εργασία μελετήθηκαν, αναπτύχτηκαν και συγκριθήκαν αρχιτεκτονικές για κρυπτογραφικές εφαρμογές που χρησιμοποιούνται στης τεχνικές πιστοποίησης μηνυμάτων. Σε αυτές χρησιμοποιήθηκαν και τεχνικές βελτιστοποίησης της απόδοσης. Στην ασφάλεια μετάδοσης των πληροφοριών, η πιστοποίηση μηνύματος είναι μία θεμελιώδης τεχνική, η οποία χρησιμοποιείται για να επιβεβαιώσει ότι τα ληφθέντα μηνύματα προέρχονται από τον σωστό αποστολέα και ότι δεν έχουν τροποποιηθεί κατά τη μετάδοση. Στην πιστοποίηση μηνύματος, απαιτείται η χρήση ενός κώδικα πιστοποίησης μηνύματος (Message
APA, Harvard, Vancouver, ISO, and other styles
21

Agrawal, Shweta Prem. "Efficient, provably secure code constructions." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-05-2675.

Full text
Abstract:
The importance of constructing reliable and efficient methods for securing digital information in the modern world cannot be overstated. The urgency of this need is reflected in mainstream media--newspapers and websites are full of news about critical user information, be it credit card numbers, medical data, or social security information, being compromised and used illegitimately. According to news reports, hackers probe government computer networks millions of times a day, about 9 million Americans have their identities stolen each year and cybercrime costs large American businesses 3.8 mil
APA, Harvard, Vancouver, ISO, and other styles
22

Samuel, Sindhu. "Digital rights management (DRM) - watermark encoding scheme for JPEG images." Diss., 2008. http://hdl.handle.net/2263/27910.

Full text
Abstract:
The aim of this dissertation is to develop a new algorithm to embed a watermark in JPEG compressed images, using encoding methods. This encompasses the embedding of proprietary information, such as identity and authentication bitstrings, into the compressed material. This watermark encoding scheme involves combining entropy coding with homophonic coding, in order to embed a watermark in a JPEG image. Arithmetic coding was used as the entropy encoder for this scheme. It is often desired to obtain a robust digital watermarking method that does not distort the digital image, even if this implies
APA, Harvard, Vancouver, ISO, and other styles
23

Juliato, Marcio. "Fault Tolerant Cryptographic Primitives for Space Applications." Thesis, 2011. http://hdl.handle.net/10012/5876.

Full text
Abstract:
Spacecrafts are extensively used by public and private sectors to support a variety of services. Considering the cost and the strategic importance of these spacecrafts, there has been an increasing demand to utilize strong cryptographic primitives to assure their security. Moreover, it is of utmost importance to consider fault tolerance in their designs due to the harsh environment found in space, while keeping low area and power consumption. The problem of recovering spacecrafts from failures or attacks, and bringing them back to an operational and safe state is crucial for reliability. Despi
APA, Harvard, Vancouver, ISO, and other styles
24

Tsai, Pei-Fang, and 蔡佩舫. "An Improved Color Visual Cryptography for Hiding Multiple Secret Messages." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/21218217095225571054.

Full text
Abstract:
碩士<br>國立成功大學<br>工程科學系碩博士班<br>94<br>The visual cryptography, proposed by Noar and Shamir in 1994, is a kind of image encrypting. It is different from traditional cryptography, because the share images can be generated without any computation and the secret image can be reconstructed with stacking share images via human visual system. Unfortunately, the reconstructed secret information is almost composed of black and white pixels, so inducing the quality of image is not desirable. In addition, the traditional visual cryptography is merely used more than two share images to encrypt a secret image
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!