Relevant bibliographies by topics / MD5

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'MD5'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 May 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'MD5.'

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.

Journal articles on the topic "MD5"

1

Bowo, Prasetyo, Sumarmi Sumarmi, and Sri Hardiatmi. "PENERAPAN MACAM DAN DOSIS PUPUK ORGANIK TERHADAP PERTUMBUHAN DAN HASIL TANAMAN GANDUM (Triticum aestivum L.)." Innofarm:Jurnal Inovasi Pertanian 21, no. 1 (November 27, 2019): 1. http://dx.doi.org/10.33061/innofarm.v21i1.3311.

Full text
Abstract:
Penelitian tentang “Penerapan macam dan dosis pupuk organik terhadap pertumbuhan dan hasil tanaman Gandum (Triticum aestivum L.)’’ telah dilaksanakan tanggal 08 November 2018 sampai 31 januari 2019 di Green House Fakultas Pertanian Universitas Slamet Riyadi Surakarta. Penelitian ini bertujuan untuk mengetahui dan menentukan pengaruh terbaik terhadap pertumbuhan dan hasil tanaman gandum. Rancangan penelitian yang digunakan adalah rancangan acak lengkap yang terdiri dari 7 perlakuan dan 5 ulangan. Perlakuan : 1) MD0 = tanpa pupk (kontrol), 2) MD1= pupuk kandang dosis 200 g/polybag, 3) MD2 = pupuk kandang dosis 400 g/polybag , 4) MD3 = pupuk guano dosis 200 g/polybag, 5) MD4 = pupuk guano dosis 400 g/polybag, 6) MD5 = pupuk kascing dosis 200 g/polybag, 7) MD6 = pupuk kascing dosis 400 g/polybag. Hasil penelitian menunjukkan bahwa : 1) penerapan macam dan dosis pupuk organik berpengaruh terhadap tinggi tanaman, jumlah daun, dan jumlah anakan, 2) penerapan macam dan dosis pupuk organik tidak berpengaruh terhadaap berat segar brangkasan, berat kering brangkasan, jumlah biji, berat biji, dan berat 100 biji, 3) macam dan dosis pupuk terbaik adalah MD2 (pupuk kandang dosis 400 g/polybag) karena dapat meningkatkan jumlah daun dan jumlah anakan.
APA, Harvard, Vancouver, ISO, and other styles
2

SASAKI, Y., Y. NAITO, N. KUNIHIRO, and K. OHTA. "Improved Collision Attacks on MD4 and MD5." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E90-A, no. 1 (January 1, 2007): 36–47. http://dx.doi.org/10.1093/ietfec/e90-a.1.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alam Hossain, Md. "Cryptanalyzing of Message Digest Algorithms MD4 and MD5." International Journal on Cryptography and Information Security 2, no. 1 (March 31, 2012): 1–13. http://dx.doi.org/10.5121/ijcis.2012.2101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pandey, Vandana, and V. K Mishra. "Architecture based on MD5 and MD5-512 Bit Applications." International Journal of Computer Applications 74, no. 9 (July 26, 2013): 29–33. http://dx.doi.org/10.5120/12914-9884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ferdiansyah, Rahmat, and Paska Marto Hasugian. "Data Security System login With MD5 Algorithms in Applications deskresy.com." Journal Of Computer Networks, Architecture and High Performance Computing 2, no. 1 (January 1, 2020): 72–76. http://dx.doi.org/10.47709/cnapc.v2i1.359.

Full text
Abstract:
Cryptography is a technique of data security by processing the data (plaintext) using an encryption method so that the the data can not be read directly, especially by unauthorized parties. Confidential Data and information need to get serious attention considering the value of information contained in it so that procedures are needed to hide the messages stored Therein. Data security Becomes very important at this time, Because for every decision or policy making must be based on the data. Md5 is a substitute for MD4, MD5 is one of the most Widely used one-way hash functions, MD5 processes the input into blocks of 512 bits, the output of md5 is 128 bits and has a fixed length. MD5 algorithm is Widely used for various purposes in making security in applications, it is Often used to help login validation on the use of passwords stored in the database system
APA, Harvard, Vancouver, ISO, and other styles
6

SOUTHGATE, V. R., L. A. TCHUEM TCHUENTÉ, A. THÉRON, J. JOURDANE, A. LY, C. B. MONCRIEFF, and B. GRYSEELS. "Compatibility of Schistosoma mansoni Cameroon and Biomphalaria pfeifferi Senegal." Parasitology 121, no. 5 (November 2000): 501–5. http://dx.doi.org/10.1017/s0031182099006708.

Full text
Abstract:
The vectorial capacity of Biomphalaria pfeifferi from Ndiangue, Senegal, was investigated with an allopatric isolate of Schistosoma mansoni from Nkolbisson, Cameroon. The snail infection rate after exposure to a single miracidium per snail (MD1) was 56·3%, and 91·6% for snails exposed to 5 miracidia per snail (MD5). The minimum pre-patent period was 21 days. The mean total cercarial production for the MD1 group was 18511 cercariae per snail, and 9757 cercariae for the MD5 group. The maximum production of cercariae for 1 day was 4892 observed in a snail from the MD1 group at day 43 post-infection. The mean longevity of snails was higher in group MD1 (88 days p.i.) than in group MD5 (65 days p.i.). The chronobiological emergence pattern revealed a circadian rhythm with one shedding peak at mid-day. Comparisons are made with the vectorial capacity of the sympatric combination of B. pfeifferi Senegal/S. mansoni Senegal.
APA, Harvard, Vancouver, ISO, and other styles
7

SASAKI, Yu, Gaoli WANG, and Lei WANG. "Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5 and MD5-MAC." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98.A, no. 1 (2015): 26–38. http://dx.doi.org/10.1587/transfun.e98.a.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Богачкова, И. А., О. С. Заикин, С. Е. Кочемазов, И. В. Отпущенников, А. А. Семенов, and О. О. Хамисов. "Problems of search for collisions of cryptographic hash functions of the MD family as variants of Boolean satisfiability problem." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 1 (April 2, 2015): 61–77. http://dx.doi.org/10.26089/nummet.v16r107.

Full text
Abstract:
Рассмотрена реализация разностной атаки на криптографические хеш-функции MD4 (Message Digest 4) и MD5 (Message Digest 5) через сведение задачи поиска коллизий для этих хеш-функций к задаче о булевой выполнимости (SAT, SATisfiability). Новизна полученных результатов заключается в том, что предложены существенно более экономные (в сравнении с известными) SAT-кодировки рассматриваемых алгоритмов, а также в использовании для решения полученных SAT-задач современных многопоточных и параллельных SAT-решателей. Задачи поиска одноблоковых коллизий для MD4 в данной постановке оказались чрезвычайно простыми. Кроме того, найдены несколько десятков двухблоковых коллизий для MD5. В процессе соответствующих вычислительных экспериментов определен некоторый класс сообщений, дающих коллизии: построено множество пар дающих коллизии сообщений, у которых первые 10 байтов нулевые. An implementation of the differential attacks on cryptographic hash functions MD4 (Message Digest 4) and MD5 (Message Digest 5) by reducing the problems of search for collisions of these hash functions to the Boolean satisfiability problem (SAT) is considered. The novelty of the results obtained consists in a more compact (compared to already known) SAT encodings for the algorithms considered and in the use of modern parallel and distributed SAT solvers in applications to the formulated SAT problems. Searching for single block collisions of MD4 in this approach turned out to be very simple. In addition, several dozens of double block collisions of MD5 are found. In the process of the corresponding numerical experiments, a certain class of messages that produce the collisions is found: in particular, a set of pairs of such messages with first 10 zero bytes is constructed.
APA, Harvard, Vancouver, ISO, and other styles
9

Forte, Dario. "The death of MD5." Network Security 2009, no. 2 (February 2009): 18–20. http://dx.doi.org/10.1016/s1353-4858(09)70020-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Touch, Joseph D. "Performance analysis of MD5." ACM SIGCOMM Computer Communication Review 25, no. 4 (October 1995): 77–86. http://dx.doi.org/10.1145/217391.217414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "MD5"

1

Sridharan, Prathap. "A survey of the attack on MD5." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3689.

Full text
Abstract:
Thesis (M.S.) -- University of Maryland, College Park, 2006.
Thesis research directed by: Applied Mathematics and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
2

Legendre, Florian. "Exploitation de la logique propositionnelle pour la résolution parallèle des problèmes cryptographiques." Thesis, Reims, 2014. http://www.theses.fr/2014REIMS006/document.

Full text
Abstract:
La démocratisation des ordinateurs, des téléphones portables et surtout de l'Internet a considérablement révolutionné le monde de la communication. Les besoins en matière de cryptographie sont donc plus nombreux et la nécessité de vérifier la sûreté des algorithmes de chiffrement est vitale. Cette thèse s'intéresse à l'étude d'une nouvelle cryptanalyse, appelée cryptanalyse logique, qui repose sur l'utilisation de la logique propositionnelle - à travers le problème de satisfaisabilité - pour exprimer et résoudre des problèmes cryptographiques. Plus particulièrement, les travaux présentés ici portent sur une certaine catégorie de chiffrements utilisés dans les protocoles d'authentification et d'intégrité de données qu'on appelle fonctions de hachage cryptographiques. Un premier point concerne l'aspect modélisation d'un problème cryptographique en un problème de satisfaisabilité et sa simplification logique. Sont ensuite présentées plusieurs façons pour utiliser cette modélisation fine, dont un raisonnement probabiliste sur les données du problème qui permet, entres autres, d'améliorer les deux principaux points d'une attaque par cryptanalyse logique, à savoir la modélisation et la résolution. Un second point traite des attaques menées en pratique. Dans ce cadre, la recherche de pré-Image pour les fonctions de hachage les plus couramment utilisées mènent à repousser les limites de la résistance de ces fonctions à la cryptanalyse logique. À cela s'ajoute plusieurs attaques pour la recherche de collisions dans le cadre de la logique propositionnelle
Democratization of increasingly high-Performance digital technologies and especially the Internet has considerably changed the world of communication. Consequently, needs in cryptography are more and more numerous and the necessity of verifying the security of cipher algorithms is essential.This thesis deals with a new cryptanalysis, called logical cryptanalysis, which is based on the use of logical formalism to express and solve cryptographic problems. More precisely, works presented here focuses on a particular category of ciphers, called cryptographic hash functions, used in authentication and data integrity protocols.Logical cryptanalysis is a specific algebraic cryptanalysis where the expression of the cryptographic problem is done through the satisfiabilty problem, fluently called sat problem. It consists in a combinatorial problem of decision which is central in complexity theory. In the past years, works led by the scientific community have allowed to develop efficient solvers for industrial and academical problems.Works presented in this thesis are the fruit of an exploration between satisfiability and cryptanalysis, and have enabled to display new results and innovative methods to weaken cryptographic functions.The first contribution is the modeling of a cryptographic problem as a sat problem. For this, we present some rules that lead to describe easily basic operations involved in cipher algorithms. Then, a section is dedicated to logical reasoning in order to simplify the produced sat formulas and show how satisfiability can help to enrich a knowledge on a studied problem. Furthermore, we also present many points of view to use our smooth modeling to apply a probabilistic reasoning on all the data associated with the generated sat formulas. This has then allowed to improve both the modeling and the solving of the problem and underlined a weakness about the use of round constants.Second, a section is devoted to practical attacks. Within this framework, we tackled preimages of the most popular cryptographic hash functions. Moreover, the collision problem is also approached in different ways, and particularly, the one-Bloc collision attack of Stevens on MD5 was translated within a logical context. It's interesting to remark that in both cases, logical cryptanalysis takes a new look on the considered problems
APA, Harvard, Vancouver, ISO, and other styles
3

Ващенко, К. А. "Розробка комп’ютерної системи конфіденційної передачі повідомлень." Thesis, Чернігів, 2020. http://ir.stu.cn.ua/123456789/23440.

Full text
Abstract:
Ващенко, К. А. Розробка комп’ютерної системи конфіденційної передачі повідомлень : випускна кваліфікаційна робота : 123 "Комп’ютерна інженерія" / К. А. Ващенко ; керівник роботи Є. В. Риндич ; НУ "Чернігівська політехніка", кафедра інформаційних та комп’ютерних систем. – Чернігів, 2020. – 71 с.
Об’єктом розробки дипломної роботи є комп’ютерна система конфіденційної передачі повідомлень, що включає в себе бібліотеку класів для розробки додатку та сервер, на якому зберігається потрібна інформація для шифрування та для знаходження користувачів один одними. Серверна частина розробляється на мові java й буде запускатися на ОС Windows, бібліотека для роботи з сервером також написана на java і її можна використовувати як і на мобільному пристрої, так і на комп’ютері. В проекті використовуються бібліотеки Gson, postgresql та популярні технології безбечної передачі інформації RSA-шифрування і digest-авторизація. Ціллю проведеної роботи – розробити сервер, який буде зберігати важливу інформацію про користувача, включаючи публічний ключ шифрування, який знадобиться для спілкування між кінцевими пристроями. Розподілити дані, що зберігає сервер, на тимчасові та постійні. Вибрати зручну базу данних (БД) для зберігання постійних данних. Зробити безпечне збереження паролів користувача в БД, щоб зловмисник, який отримає доступ до БД, не міг узнати чужих паролів та видати себе за іншого користувача. Надати зручний спосіб для роботи з сервером у вигляді бібліотеки. Поставлені наступні основні задачі: - Вибір популярної та зручної мови програмування; - Знайомство з принципами шифрування, безпечного зберігання конфіденційної інформації, знайомство з роботою з базою даних; - Налаштувати зручну БД; - Реалізувати проект; В ході виконання роботи були розроблені : - Сервер; - БД; - Бібліотека для звернення до серверу.
The object of thesis development is a computer system for safe message transfer that includes a library of classes for app development and server that contains useful user information for encrypting messages and for finding each other. The server part is being developed in java language and will be launching in Windows OS, library for working with server is written in java too and programmer can use this library for developing computer app and mobile app too. Project uses Gson, postgres libraries and popular technologies for safe information transfer: RSA-encrypting and digest-authorization. The purpose of this work is to develop a server, which will save important information about user, inculding public key for encrypting too that will be used by end-to-end peers. To part data, that server saves, on terminal and persistant. To make safe saving of user passwords in database(DB), because of malefactor who can get access to database and then he can to pretend to be other man. To deliver convinient interface for working with server. The following main tasks are set: Choosing the popular and convinient programming language ; Familiarity with the encrypting theory and principles, with ways of saving confidential information safe, perusing theory for working with DB using chosen programming language; Configuring DB; Writing project; In the course of the work were developed : Server; Database; Library for requesting a server;
APA, Harvard, Vancouver, ISO, and other styles
4

Hajný, Jan. "Návrh řešení autentizace uživatelů pro malé a střední počítačové sítě." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217309.

Full text
Abstract:
The main focus of this Master’s thesis is user authentication and access control in a computer network. I analyze the TCP/IP model in connection with security and describe main stepping stones of authentication protocols (mainly hash functions). The authentication protocol analysis follows. I begin with LANMAN protocol analysis for the reason of a security comparison. The NTLM, Kerberos and Radius follows. The focus is on the Kerberos which is chosen as a main authentication protocol. This is also a reason why the modification used in MS domains is described. The implementation and functional verification is placed in the second part which is more practical. The virtualization technology is used for an easier manipulation. The result is a computer network model requiring user authentication and minimizing the possibility of an attack by unauthorized clients.
APA, Harvard, Vancouver, ISO, and other styles
5

Piller, Igor. "Hashovací funkce a jejich využití při autentizaci." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218115.

Full text
Abstract:
This thesis concerns with hash functions and their usage in authentication. It presents basics of hash functions theory and construction elements. In particular the thesis focuses on LMHash, MD4, MD5 and SHA family hash functions, which are compared from the security point of view. The thesis describes in general the most frequently used hash function attacks, points out the weaknesses of current construction and mentions the future perspective of hash functions. Furthermore the thesis outlines the area authentication and describes usage of hash functions in the area. Practical part of the thesis contains an implements of a general authentication framework implemented in programming language C#. The result is client and server applications, in which two selected authentication methods were successfully tested. The result implementation is flexible with respect to the possible future use of other authentication methods.
APA, Harvard, Vancouver, ISO, and other styles
6

Hadjichristofi, George Costa. "IPSec Overhead in Wireline and Wireless Networks for Web and Email Applications." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/35710.

Full text
Abstract:
This research focuses on developing a set of secure communication network testbeds and using them to measure the overhead of IP Security (IPSec) for email and web applications. The network testbeds are implemented using both wireline and wireless technologies. The testing involves a combination of authentication algorithms such as Hashed Message Authentication Code-Message Digest 5 (HMAC-MD5) and Hashed Message Authentication Code-Secure Hash Algorithm 1 (HMAC-SHA1), implemented through different authentication protocols such as ESP and AH, and used in conjunction with the Triple Digital Encryption Standard (3DES). The research examines the overhead using no encryption and no authentication, authentication and no encryption, and authentication and encryption. A variety of different sizes of compressed and uncompressed files, are considered when measuring the overhead. The testbed realizes security using IPSec to secure the connection between different nodes. The email protocol that is used is the Simple Mail Transfer Protocol (SMTP) and the web protocol considered is the Hyper Text Transfer Protocol (HTTP). The key metrics considered are the network load in bytes, the number of packets, and the transfer time. This research emphasizes the importance of using HTTP to access files than using SMTP. Use of HTTP requires fewer packets, lower network loads, and lower transfer times than SMTP. It is demonstrated that this difference, which occurs regardless of security, is magnified by the use of authentication and encryption. The results also indicate the value of using compressed files for file transfers. Compressed and uncompressed files require the same transfer time, network load and number of packets since FreeS/WAN IPSec does not carry any form of compression on the data before passing it to the data link layer. Both authentication algorithms, HMAC-MD5 and HMAC- SHA1, result in about the same network load and number of packets. However, HMAC-SHA1 results in a higher transfer time than HMAC-MD5 because of SHA1's higher computational requirements. ESP authentication and ESP encryption reduce the network load for small files only, compared to ESP encryption and AH authentication. ESP authentication could not be compared with AH authentication, since the FreeS/WAN IPSec implementation used in the study does not support ESP authentication without using encryption. In a wireless environment, using IPSec does not increase the network load and the number of transactions, when compared to a wireline environment. Also, the effect of security on transfer time is higher compared to a wireline environment, even though that increase is overshadowed by the high transfer time percentage increase due to the wireless medium.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
7

Trusz, Jakob. "Content Management Systems and MD5: Investigating Alternative Methods of Version Identification for Open Source Projects." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14821.

Full text
Abstract:
WordPress is a very widely used content management system that enables users to easier create websites. The popularity of WordPress has made it a prime target for attacks by hackers since a potential vulnerability would affect many targets. Vulnerabilities that can be utilised in an attack are referred to as exploits. Most exploits are only viable for a subset of all the version of the software that they target. The knowledge of which version of a content managements system a website is running is often not explicit or easy to determine. Attackers can potentially exploit a vulnerable website faster if the version is known, since this allows them to search for existing vulnerabilities and exploits, instead of trying to identify a new vulnerability. The purpose of this thesis is to investigate existing and alternate methods for detecting the version of WordPress on websites that are powered by it. The scope is limited to an analysis of existing tools and the suggested methods for version identification are limited to identification using unique values that are calculated from the contents of files. The suggested methods for version identification and the generation of the required data is implemented using Python 3, the programming language. We investigate the feasibility of version obfuscation, how discernible a version of WordPress is, and how to compare versions of WordPress. The thesis has proven the feasibility of version identification with a new perspective that delivers more accurate results than previous methods. Version obfuscation has also been proven to be very feasible without affecting the usability of the WordPress website. Furthermore, a method for discerning between two specific versions of WordPress is presented. All the results are in theory applicable to other software projects that are hosted and developed in the same way. This new area of research has much for security professionals and has room for future improvement.
APA, Harvard, Vancouver, ISO, and other styles
8

Lokby, Patrik, and Manfred Jönsson. "Preventing SQL Injections by Hashing the Query Parameter Data." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14922.

Full text
Abstract:
Context. Many applications today use databases to store user informationor other data for their applications. This information can beaccessed through various different languages depending on what typeof database it is. Databases that use SQL can maliciously be exploitedwith SQL injection attacks. This type of attack involves inserting SQLcode in the query parameter. The injected code sent from the clientwill then be executed on the database. This can lead to unauthorizedaccess to data or other modifications within the database. Objectives. In this study we investigate if a system can be builtwhich prevents SQL injection attacks from succeeding on web applicationsthat is connected with a MySQL database. In the intendedmodel, a proxy is placed between the web server and the database.The purpose of the proxy is to hash the SQL query parameter dataand remove any characters that the database will interpret as commentsyntax. By processing each query before it reaches its destination webelieve we can prevent vulnerable SQL injection points from being exploited. Methods. A literary study is conducted the gain the knowledgeneeded to accomplish the objectives for this thesis. A proxy is developedand tested within a system containing a web server and database.The tests are analyzed to arrive at a conclusion that answers ours researchquestions. Results. Six tests are conducted which includes detection of vulnerableSQL injection points and the delay difference on the system withand without the proxy. The result is presented and analyzed in thethesis. Conclusions. We conclude that the proxy prevents SQL injectionpoints to be vulnerable on the web application. Vulnerable SQL injectionpoints is still reported even with the proxy deployed in thesystem. The web server is able to process more http requests that requiresa database query when the proxy is not used within the system.More studies are required since there is still vulnerable SQL injectionspoints.
APA, Harvard, Vancouver, ISO, and other styles
9

Karlsson, Marcus, and Oscar Zaja. "Improving Security In Embedded Systems With IEEE 802.1X." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-53322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dahlin, Karl. "Hashing algorithms : A comparison for blockchains in Internet of things." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34057.

Full text
Abstract:
In today’s society blockchains and the Internet of things are two very discussed subjects this has led to thoughts about combining them by using a blockchain in Internet of things. This objective of this study has been to solve the problem which hashing algorithms is the best for a blockchain used in an Internet of things network. This have been done by first selecting a few hashing algorithms and setting up a scenario where a blockchain can be used in an Internet of things network. After that I specified what to compare, speed, input length and output length. The study has been conducted with the aid of literary studies about the hashing algorithms and a program that implements the algorithms and tests their speed. The study has shown that out of the selected hashing algorithms MD5, SHA-256, SHA3-256 with the conditions specified for the study that the hashing algorithm SHA3-256 is the best option if speed is not of the utmost importance in the scenario since it is from a newer standard and do not have a max input length. If speed is the very important in other words if SHA3-256 is to slow then SHA-256 would be best for the Internet of things network.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "MD5"

1

chos/, 1931 'jam dbyangs dam. rang gi mi tshe'i byung ba mdo tsam brjod pa drang srong rgan po'i srang mda'. Lan kru'u: Kan su'u mi rigs dpe skrun khang, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Massachusetts. Metropolitan District Commission. Division of Parks and Recreation. MDC bikepaths. Boston: MDC, Division of Parks and Recreation, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Montana. Dept. of Transportation. Public Affairs Bureau. The MDT interchange. Helena: Public Affairs Bureau, Montana Dept. of Transportation, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aaron, Mnguni, ed. Imidlalo kaZakes Mda. Pitori: Yunivesithi yeSewula Afrika, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hopp, Julia. The MDS troubleshooter. 2nd ed. Marblehead, MA: Opus Communications, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mdo gzer mig. [China]: Kruṅ-goʼi Bod kyi śes rig dpe skrun khaṅ, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Around the M25. London: Hale, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hopp, Julia. The MDS troubleshooter. 3rd ed. Marblehead, MA: HCPro, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Great Britain. Central Office of Information. M25 orbital motorway. London: Department of Transport, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

MI5, Great Britain. MI5: The security service. 2nd ed. London: HMSO, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "MD5"

1

Mouha, Nicky. "MD4-MD5." In Encyclopedia of Cryptography and Security, 768–71. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_595.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Xiaoyun, Hongbo Yu, Wei Wang, Haina Zhang, and Tao Zhan. "Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC." In Advances in Cryptology - EUROCRYPT 2009, 121–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01001-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sasaki, Yu. "Collisions of MMO-MD5 and Their Impact on Original MD5." In Lecture Notes in Computer Science, 117–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21969-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Fanbao, and Tao Xie. "How to Break EAP-MD5." In Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, 49–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30955-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aumasson, Jean-Philippe, Samuel Neves, Zooko Wilcox-O’Hearn, and Christian Winnerlein. "BLAKE2: Simpler, Smaller, Fast as MD5." In Applied Cryptography and Network Security, 119–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38980-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sasaki, Yu, and Kazumaro Aoki. "Preimage Attacks on Step-Reduced MD5." In Information Security and Privacy, 282–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-70500-0_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kim, Jongsung, Alex Biryukov, Bart Preneel, and Sangjin Lee. "On the Security of Encryption Modes of MD4, MD5 and HAVAL." In Information and Communications Security, 147–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11602897_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aoki, Kazumaro, and Yu Sasaki. "Preimage Attacks on One-Block MD4, 63-Step MD5 and More." In Selected Areas in Cryptography, 103–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04159-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sasaki, Yu, and Lei Wang. "Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5." In Selected Areas in Cryptography -- SAC 2013, 493–512. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43414-7_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

den Boer, Bert, and Antoon Bosselaers. "Collisions for the compression function of MD5." In Advances in Cryptology — EUROCRYPT ’93, 293–304. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-48285-7_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "MD5"

1

Yong-Xia, Zhao, and Zhen Ge. "MD5 Research." In 2010 Second International Conference on Multimedia and Information Technology. IEEE, 2010. http://dx.doi.org/10.1109/mmit.2010.186.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Touch, Joseph D. "Performance analysis of MD5." In the conference. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/217382.217414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ming, Hu, and Wang Yan. "MD5-Based Error Detection." In 2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS). IEEE, 2009. http://dx.doi.org/10.1109/paccs.2009.147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Libed, Jake M., Ariel M. Sison, and Rujie P. Medina. "Enhancing MD5 Collision Susceptibility." In ICIBE' 18: 2018 4th International Conference on Industrial and Business Engineering. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3288155.3288173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Om Kumar, C. U., S. Kishore, and A. Geetha. "Debugging using MD5 process firewall." In 2014 International Conference on Contemporary Computing and Informatics (IC3I). IEEE, 2014. http://dx.doi.org/10.1109/ic3i.2014.7019657.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

de Guzman, Larry B., Ariel M. Sison, and Ruji P. Medina. "MD5 Secured Cryptographic Hash Value." In the 2018 International Conference. New York, New York, USA: ACM Press, 2018. http://dx.doi.org/10.1145/3278312.3278317.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liao, Hancheng. "Image Retrieval Based on MD5." In 2008 International Conference on Advanced Computer Theory and Engineering (ICACTE). IEEE, 2008. http://dx.doi.org/10.1109/icacte.2008.76.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Wang, Chen Jianhua, and He Debiao. "A New Collision Attack on MD5." In 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC). IEEE, 2009. http://dx.doi.org/10.1109/nswctc.2009.264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Landge, Irfan A., and Hannan Satopay. "Secured IoT Through Hashing Using MD5." In 2018 Fourth International Conference on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics (AEEICB). IEEE, 2018. http://dx.doi.org/10.1109/aeeicb.2018.8481007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Afre, Ashwini S., Manisha Bharati, and Sharvaree Tamane. "DeyPos: For multi-users environments using MD5." In 2017 1st International Conference on Intelligent Systems and Information Management (ICISIM). IEEE, 2017. http://dx.doi.org/10.1109/icisim.2017.8122181.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "MD5"

1

Touch, J. Report on MD5 Performance. RFC Editor, June 1995. http://dx.doi.org/10.17487/rfc1810.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baker, F., and R. Atkinson. RIP-2 MD5 Authentication. RFC Editor, January 1997. http://dx.doi.org/10.17487/rfc2082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Turner, S., and L. Chen. Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms. RFC Editor, March 2011. http://dx.doi.org/10.17487/rfc6151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Melnikov, A. Moving DIGEST-MD5 to Historic. RFC Editor, July 2011. http://dx.doi.org/10.17487/rfc6331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Metzger, P., and W. Simpson. IP Authentication using Keyed MD5. RFC Editor, August 1995. http://dx.doi.org/10.17487/rfc1828.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Myers, J., and M. Rose. The Content-MD5 Header Field. RFC Editor, October 1995. http://dx.doi.org/10.17487/rfc1864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rivest, R. The MD5 Message-Digest Algorithm. RFC Editor, April 1992. http://dx.doi.org/10.17487/rfc1321.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rose, M. The Content-MD5 Header Field. RFC Editor, November 1993. http://dx.doi.org/10.17487/rfc1544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bellovin, S. Key Change Strategies for TCP-MD5. RFC Editor, March 2007. http://dx.doi.org/10.17487/rfc4808.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Oehler, M., and R. Glenn. HMAC-MD5 IP Authentication with Replay Prevention. RFC Editor, February 1997. http://dx.doi.org/10.17487/rfc2085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'MD5' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography