On the security of digital signature protocol based on iterated function systems.

A common goal of cryptographic research is to design protocols that provide a confidential and authenticated transmission channel for messages over an insecure network. Hash functions are used within digital signature schemes to provide data integrity for cryptographic applications. In this paper, we take a closer look at the security and efficiency of the digital signature protocol based on fractal maps. This new system can be expected to have at least the same computational security against some known attacks. A Diffie-Hellman algorithm is used to improve the security of the proposed protocol by generating the number of iteration that is used to find the attractor of the iterated function system, which is used to calculate the public key and the signature. The proposed algorithm possesses sufficient security against some known attacks applicable on finite field cryptosystems. They are considered as time consuming to be involved in solving non-linear systems numerically over the defined infinite subfield

Biometric identification using local iterated function

Biometric identification protocol has been received an increasing interest recently. It is a process that determines person identity by making use of their biometric features. A new biometric identification method is presented in this paper based on partial self-similarity that used to identify features within fingerprint images. This approach is already used in Fractal Image Compression (FIC) due to their ability to represent the images by a limited number of affine transformations, and its variation of scale, translation or rotation. These features give the recognition process high impact and good performance. To process data in a fingerprint image, it first converted into digital format using Optical Fingerprint Reader (OFR). The verification process is done by comparing these data with the server data. The system analysis shows that the proposed method is efficient in terms of memory and time complexity

A new public key cryptosystem based on IFS

Most public key encryption methods suffers from the inability to prove the difficulty of the algorithms, which summarizes under the category of mathematical problems that have inverses which are believed (but not proven) to be hard. The length and strength of the Cryptography keys are considered an important mechanism. The keys used for encryption and decryption must be strong enough to produce strong encryption. Fractals and chaotic systems have properties which have been extensively studied over the years, and derive their inherent complexity from the extreme sensitivity of the system to the initial conditions. In this paper a new cryptographic system based on Iterated Function Systems ( IFS) have been proposed to reduce the computation cost and increase the security for the public-key cryptography protocols. In the proposed public-key encryption algorithm, generate iterated function systems as a global public element, then its Hutchinson operator is used as a public key. To encrypt the plaintext with the receiver's public key we use one of the key agreement protocols to generate a shared private key that used to find the attractor of the IFS. The chaotic nature of the fractal functions ensures the security of the proposed public-key cryptosystem scheme

Fractal attractor based digital signature

Fractal theories are applied to enhance the efficiency and performance of cryptosystem due to their inherent complexity and mathematical framework. A new digital signature scheme based on Iterated Function System (IFS) is proposed, which can reduce computation cost and increase security of the system. The properties of the proposed system are discussed in detail

About fuzzy fixed point theorem in the generalized fuzzy fractal space.

The Banach fixed point theorem has applications in several branches of science. Many authors prove this theorem in different types of fuzzy metric spaces and fuzzy fractal spaces. The aim of this paper is to prove the Banach fixed point theorem in a new generalized space called multi fuzzy fractal space

Efficiency analysis for public key systems based on fractal functions.

In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated mathematical structure and deterministic nature that meet the cryptographic requirements. In this study we propose a new public key cryptosystem based on Iterated Function Systems (IFS). Results: In the proposed protocol, the attractor of the IFS is used to obtain public key from private one, which is then used with the attractor again to encrypt and decrypt the messages. By exchanging the generated public keys using one of the well known key exchange protocols, both parties can calculate a unique shared key. This is used as a number of iteration to generate the fractal attractor and mask the Hutchinson operator, so that, the known attacks will not work anymore. The algorithm is implemented and compared to the classical one, to verify its efficiency and security. We conclude that public key systems based on IFS transformation perform more efficiently than RSA cryptosystems in terms of key size and key space

Several small Josephson junctions in a Resonant Cavity: Deviation from the Dicke Model

We have studied quantum-mechanically a system of several small identical Josephson junctions in a lossless single-mode cavity for different initial states, under conditions such that the system is at resonance. This system is analogous to a collection of identical atoms in a cavity, which is described under appropriate conditions by the Dicke model. We find that our system can be well approximated by a reduced Hamiltonian consisting of two levels per junction. The reduced Hamiltonian is similar to the Dicke Hamiltonian, but contains an additional term resembling a dipole-dipole interaction between the junctions. This extra term arises when states outside the degenerate group are included via degenerate second-order (L\"{o}wdin) perturbation theory. As in the Dicke model, we find that, when N junctions are present in the cavity, the oscillation frequency due to the junction-cavity interaction is enhanced by $\sqrt{N}$. The corresponding decrease in the Rabi oscillation period may cause it to be smaller than the decoherence time due to dissipation, making these oscillations observable. Finally, we find that the frequency enhancement survives even if the junctions differ slightly from one another, as expected in a realistic system.Comment: 11 pages. To be published in Phys. Rev.

E–Voting System based on Secret Sharing Scheme

The electoral process is considered as one of the important and sensitive operations that take place from time to time in all countries of the world and need to be protected. The importance of the electronic voting came because, it provides a maintaining for the secrecy of the vote, as well as, the speed, accuracy and credibility of the vote counts. This is due to the growing of the technology that always needs for electronic process and for new approaches to achieve high security. In this paper, a new E-voting system is designed based on secret sharing scheme. The new protocol is implemented to show its efficiency in terms of computational time and cost

Water resource management for sustainable development

Water resource management is the cornerstone for sustainable development. According to the United Nations world water development report, one-fifth of the world?s population lives in areas characterized by physical water scarcity.info:eu-repo/semantics/publishedVersio

Preventing type 2 diabetes mellitus in Qatar by reducing obesity, smoking, and physical inactivity: mathematical modeling analyses.

BACKGROUND: The aim of this study was to estimate the impact of reducing the prevalence of obesity, smoking, and physical inactivity, and introducing physical activity as an explicit intervention, on the burden of type 2 diabetes mellitus (T2DM), using Qatar as an example. METHODS: A population-level mathematical model was adapted and expanded. The model was stratified by sex, age group, risk factor status, T2DM status, and intervention status, and parameterized by nationally representative data. Modeled interventions were introduced in 2016, reached targeted level by 2031, and then maintained up to 2050. Diverse intervention scenarios were assessed and compared with a counter-factual no intervention baseline scenario. RESULTS: T2DM prevalence increased from 16.7% in 2016 to 24.0% in 2050 in the baseline scenario. By 2050, through halting the rise or reducing obesity prevalence by 10-50%, T2DM prevalence was reduced by 7.8-33.7%, incidence by 8.4-38.9%, and related deaths by 2.1-13.2%. For smoking, through halting the rise or reducing smoking prevalence by 10-50%, T2DM prevalence was reduced by 0.5-2.8%, incidence by 0.5-3.2%, and related deaths by 0.1-0.7%. For physical inactivity, through halting the rise or reducing physical inactivity prevalence by 10-50%, T2DM prevalence was reduced by 0.5-6.9%, incidence by 0.5-7.9%, and related deaths by 0.2-2.8%. Introduction of physical activity with varying intensity at 25% coverage reduced T2DM prevalence by 3.3-9.2%, incidence by 4.2-11.5%, and related deaths by 1.9-5.2%. CONCLUSIONS: Major reductions in T2DM incidence could be accomplished by reducing obesity, while modest reductions could be accomplished by reducing smoking and physical inactivity, or by introducing physical activity as an intervention