In recent times amount of Data is increasing rapidly and analysis of Data is a must to come up with business decisions, predictions etc. It’ s not just text are numbers which has to be stored properly. Data Types these days varies from images, video, social media Data, surveys to blogs etc. When this is the case its mandatory to deal with BigData and to safeguard those BigData. Technologies available in BigData and Bitcoin helps us in achieving this. BigData technologies helps in storing the unstructured Data effectively and processing of such voluminous Data is taken care of. Hashing algorithms are used in Blockchain to keep the Data safe. Hashing algorithms like SHA 256 are used to make it more secure. Its almost not possible to break the Data available in Blockchain. Let’ s try to secure the Data even more Using encryption algorithms to make sure that proper Data is used for analysis etc.

Deterministic measurement matrices have a crucial character in compressive sensing (CS) applications. These matrices can be generated randomly and deterministically. Due to less memory needed for storage, deterministic matrices have been taken into consideration vastly rather than random ones. In this paper, by use of Hash functions (HF), a group of new measurement matrices has been presented. For this purpose, first, a primary matrix of code is generated then by use of Hash matrices a new matrix is produced.Finally by normalizing the new matrix elements, measurement matrix will be generated. Through this construction, a group of measurement matrices with size of p 2 ´ p 3 and coherence coefficient equal to1 p, where p is a prime integer, will be obtained.Simulation results illustrate that for low values of p, proposed matrices slightly outweigh BCH sampling matrices.

Hash functions have a very important role in network and telecommunication security. These functions play an important role in Hashing a message which are widely used in cryptographic applications such as digital signatures, random number generator algorithms, authentication protocols, and so on. Rotational cryptanalysis is a relatively new attack that is part of a generic attack on Hash functions and is effective on algorithms that have an ARX structure. In this paper, for the first time, we apply a rotational cryptanalysis and with the given assumption of the markov chain for the modular additions sequence employed in two algorithms Shabal and CubeHash, which are second-round candidates for the SHA-3 competition that use the ARX property in their structure. With the implementation of rotational cryptanalysis we arrived at the complexity of 2-3393. 58 for the entire 16+3-rounds Shabal algorithm and the complexity of 2-57. 6 for the en-tire 16-round CubeHash algorithm. According to the obtained results, it can be seen that due to the large number of modular additions with the given assumption of markov chain, the Shabal algorithm exhibits greater resistance to rotational cryptanalysis, compared to the CubeHash algorithm and is less likely to succeed.

Nowadays, as tampering attacks getting more attention, Data protection Radio Frequency Identification tag (RFID) becomes more important. The watermarking approach prevents unauthorized changes on the content of such labels. Due to the limitations of such tags like their simple structure, scarcity of memory bits and its binary content, Using conventional methods likes watermarking and Hash function are impossible. Thus, the approaches that can be applied to binary Data with low size are used. This paper is based on a special algorithm of neural networks that is used to create the Hash and the watermarking code that causes fewer number of valuable bits of memory to be consumed. In the proposed algorithm, all watermarking bits are securely protected and locations of the watermark bits is not detectable. This method not only has no need for secrecy watermarking algorithms, but also has other benefits such as ease and speed of implementation. Another advantage of the proposed approach is the two-step algorithm with its keys and Using pseudo-random bits location makes watermark's probability of detection very difficult and inaccessible, and also increase the robustness of the method.

The unique characteristics of the Underwater Acoustic Communication (UWAC) channel cause the UWAC systems to be very vulnerable to the malicious attacks. So, the bionic-based UWAC has been used due to its good covert performance, and its suitable frequency and correlation properties. It may not be covert in all the underwater environments, or an adversary can detect the message anyway. Therefore, this paper aims at proposing an improved Merkle Hash tree based secure scheme that can resist the current possible underwater attacks, i. e., the replay attack, the fabricated message attack, the message altering attack, and the analyst attack. The security analysis indicates that the proposed scheme is resilient to the mentioned attacks. Also, the performance evaluations show that the proposed scheme is proportional to the UWAC limitations due to its efficiency in terms of energy consumption, communication overhead, and computation cost.

The body freedom flutter phenomenon is one of the aeroelastic instabilities that occurs due to the coupling of the aeroelastic bending mode of the wing with the short-period mode in the flight dynamics of the aircraft. By Using the aeroservoelastic model and applying closed loop control, this phenomenon can be suppressed in the operating conditions of the aircraft and the velocity of this event can be increased. The simplest model aircraft capable of displaying this instability includes the flexible wing and the planar flight dynamics model. For this purpose, the wing structure is modeled Using the Euler-Bernoulli beam and, the theory of minimum variable state is used to model unstable aerodynamics to make the conditions suitable for modeling the system in state space. In the control section, the elevator is used as the control surface and LQR theory with Kalman filter is used to body freedom flutter suppression. Finally, the effect of adding a closed loop control to increase the body freedom flutter velocity and the limitations of this work are studied.

Background and Objectives: Cryptographic Hash functions are the linchpins of mobile services, blockchains, and many other technologies. Designing cryptographic Hash functions has been approached by research communities from the physics, mathematics, computer science, and electrical engineering fields. The emergence of new Hash functions, new Hash constructions, and new requirements for application-specific Hash functions, such as the ones of mobile services, have encouraged us to make a comparison of different Hash functions and propose a new classification.Methods: Over 100 papers were surveyed and reviewed in detail. The research conducted in this paper has included four sections; article selection, detailed review of selected articles, Data collection, and evaluation of results. Data were collected as new Hash function properties, new Hash function constructions, new Hash function categories, and existing Hash function attacks which are used to evaluate the results.Results: This paper surveys seven categories of Hash functions including block cipher-based functions, algebraic-based functions, custom-designed functions, Memory-hard Functions (MHFs), Physical Unclonable Functions (PUFs), quantum Hash functions and optical Hash functions. To the best of our knowledge, the last four mentioned categories have not been sufficiently addressed in most existing surveys. Furthermore, this paper overviews Hash-related adversaries and six Hash construction variants. In addition, we employed the mentioned adversaries as evaluation criteria to illustrate how different categories of Hash functions withstand the mentioned adversaries. Finally, the surveyed Hash function categories were evaluated against mobile service requirements.Conclusion: In addition to new classification, our findings suggest Using PUFs with polynomial-time error correction or possibly bitwise equivalents of algebraic structures that belongs to post-quantum cryptography as candidates to assist mobile service interaction requirements.

The neoclassical growth model is tested by use of panel Data procedure in this research. In the econometric test, simoultanously time series and cross detection will be compared on the basis of panel Data method through which their observed points increase and consequently the estimation efficiency will be increased. The examination of neoclassical growth theory has been done with reference to external & internal factors of 52 selected countries from 1960 to 2000. The independent variable of model has been selected on the basis of the result of previous research which explains the result in three separate models: developed countries, developing countries, and whole countries. These factors are such as: Gross National Products with lag of period, work force age, growth rate, education level, the change of capital accumulation and economic trade volum. The consequences of this research is that: neoclassical growth model can explain the major part of economic growth of the countries with use of internal variables. Also with the use of panel procedure of fixed effect, we can see the fundamental differences and structure of the growth process for different countries; and show how the economic, and social conditions affect on the growth.

In this paper, we describe an attack on a new double block length Hash function which was proposed as a variant of MDC-2 and MDC-4. The vMDC-2 compression function is based on two calls to a block cipher that compresses a 3n-bit string to a 2n-bit one. This attack is based on the Joux's multicollision attack, where we show that an adversary wins finding collision game by requesting 270 queries for n=128-bit block cipher that is much less than the complexity of birthday attack.