Cryptography

Chapter 1 what is Blockchain? Basically, Blockchain is a system created essentially for the running of cryptocurrencies. Wikipedia defines a cryptocurrency as a digital asset that works as a medium of exchange and uses cryptography to secure all transactions and to control the creation of additional units of the currency. An example of such cryptocurrencies is the bitcoin. In this article, we will understand the following: • Basic meaning of blockchain • What it comprises of • How it…

Introduction RSA is a type of cryptography that is use for encrypting and decrypting of messages. It was created by Ronald L. Rivest, Adi Shamir and Leonard M. Adleman in the faculty of the Massachusetts Institute of Technology. RSA (Rivest, Shamir, Adleman) is named after the three inventors. RSA is still widely used for securing the confidentiality and authenticity of an e-mail. It is also use to secure communication through the internet. It is particularly useful when conducting e-commerce.…

the existing hash function and the insertion of the desired function. RQ 4 A one-way function is an algorithm or a function that is used to turn a piece of text into a fixed string of digits and is nearly impossible to reverse the process. In cryptography, a one-way function is used to create digital signatures which are used to identify, and authenticate the sender and the message. RQ 5 The Deffie Hellman key exchange uses the simple concept of prime numbers to generate a list of security…

1.1.1 Types of Sensor Networks Terrestrial WSNs: - In Terrestrial WSNs, nodes are distributed in a given area either in a pre-planned manner (sensor nodes are placed according to optimal placement, grid placement, 2-d and 3-d placement models) or in an ad hoc manner (sensor nodes are randomly placed in the target area by dropping it from plane). After all battery power is limited and it cannot be reenergized, terrestrial sensor nodes must be provided with a maximum power source such as solar…

In this way file is reconstructed back from its shares. The size of each piece is |F| / (n-k), where |F| is size of secret/data, which is smaller than size of each piece produced through algorithm explained in [52]. In this scheme, m-1 shares of file F may provide some information about F. So in this scheme it is advisable to encrypt F before dispersing it and decode it after reconstruction of the encrypted version. One possible attack on the security of the data dispersed among servers would be…

TEST AND SECURITY EVALUATION PLATFORM Background Work: The need for safe and secure identity authentication is increasing day by day as the number of identity theft occurrences is growing. The strongest security is implemented within the hardware itself. There are two key concepts in designing for testability: Controllability and Observability. Controllability refers to the ability to apply test patterns to the inputs of a sub circuit via the primary inputs of the circuit. Observability refers…

Holmes/Scarpetta Project- The Valley of Fear What discipline was involved? Digital Forensics (cryptology)- The process of encrypting messages and examining digital media forensically to find, analyze, and present facts and opinions. What was the equipment used? The ciphers represent the pages of previous editions of Whitaker's Almanack. The first number represented the page number in the Almanac. The second number, C2, was the column number on the page in the book. The numbers that…

2.3.1 Frequency attacks Techniques that are based on deterministic encryption are usually susceptible to frequency attacks. The party receiving the “so thought” secure encrypted data can perform a frequency analysis on selected fields in order to uncover the original data. For example, if the attacker has access to the demographic or census data of a particular population, he could calculate the frequency of a selected field and try to map it to the encrypted data frequencies to deduce a…

A and B and C), he can create a trapdoor in arbitrary order as one search token, that’s mean he can send one of the following combined keywords (A∥B∥C), (A∥C∥B), (B∥A∥C), (B∥C∥A), (C∥A∥B) or (C∥B∥A) as a query to the remote server. Then the server tests the Bloom filter against the trapdoor and retrieves the associated matched document to DU without needing for the posting list intersection protocol. Our scheme consists of six algorithms KeyGenerator, BuildIndex, DocEncrypt, Trap- doorGen,…

IV Methodology The AES algorithm has 4 phases that execute the process in sequential manner. The encryption process is achieved by processing plain text and key for initial and 9 rounds, Same decryption is takes place but in reverse manner. A 4x4 state is formed in each round and particular length data is introduced in it for encryption process.The 10, 12, 14 rounds are there for 128, 192,256 bits in length respectively. Initially a key expansion process is used to expand the basic 16 byte key…