Search

The reduction of constrained mathematical structures leads us to generalize any abstract structures. Using minimum conditions to construct a secure and robust component of the modern encryption algorithm is one crucial problem in multimedia security. With this understanding, we have proposed a new algebraic structure, namely monogenic semigroup, to construct a digital information authentication scheme. Authentication is always completed at the beginning of the application, before any throttling or approval checks are performed, and before any other code is allowed to begin running in the background. Many authentication schemes offer a complex structure for implementation in cryptosystems and applications. The anticipated mechanism uses a simple mathematical structure having the least conditions as compared to other mathematical structures. The suggested scheme provides structures for the authentication of text messages and images. [ABSTRACT FROM AUTHOR]

Privacy of information is one of the most important and unavoidable issues in our digitally advance era. A huge amount of information transmitted over different servers and networking protocols. The sphere of digitally advanced world is tied with information in different forms of facilitations, which includes online banking systems, ecommerce and many more. Providing the ease of access, anything online makes our confidential information open to different threats. Therefore, to enjoy ease of access and at the same time secure our digital information from theft, we need a robust information security system. In this article, we have designed a novel and an efficient security system, which provides secrecy to our digital information. The designed encryption scheme is fundamentally a combination of chaos and nonlinear confusion components. We have developed a new mechanism of adding confusion, namely S 8 permutation of double affine transformation to construct 40320 new substitution boxes (S-boxes) having nonlinearity 112 from a single S-box. Moreover, nonlinear Lorenz dynamical system is utilized to select any three S-boxes from 40320 newly generated nonlinear components. To add diffusion in our proposed algorithm, we have utilized Chirikov discrete iterative map. The excellence of an offered digital image encryption has been examined and evaluated with standard benchmarks. The simulation results reveal that the quality of the image encryption passes all these tests and is comparable to current benchmarks. • Privacy of information is one of the most important and unavoidable issues in our digitally advance era. • A huge amount of information transmitted over different servers and networking protocols. • The sphere of digitally advanced world is tied with information in different forms of facilitations, which includes online banking systems, ecommerce and many more. • In this article, we have designed a novel and an efficient security system, which provides secrecy to our digital information. • We have developed a new mechanism of adding confusion, namely S8 permutation of double affine transformation to construct 40320 new substitution boxes (S-boxes) having nonlinearity 112 from a single S-box. • To add diffusion in our proposed algorithm, we have utilized Chirikov discrete dynamical system. [ABSTRACT FROM AUTHOR]

The strength of any block cipher depends on the key size, total number of rounds and the strength of confusion component against differential cryptanalysis. Data encryption standard (DES) as a block cipher has enjoyed a worldwide acceptance for more than three decades. It is a symmetric block cipher and considered to be very strong against all known attacks at that time. It uses 64-bit key size and block size, but the advancement in technology results in increasing the speed of the computers and thus makes DES not secure any more. The shorter key size is the weak area of DES. In this article, we have increased the block size as well as the key size from 64 to 128 bits. The internal structure of our proposed mechanism ultimately changed all other components of DES accordingly. By this improvement, our anticipated scheme is more secure due to its robust due to its confusion and diffusion components. The algorithm is applied on the plain text and on images. We have performed the standard benchmarks statistical analyses on our suggested encryption scheme in order to authenticate the anticipated mechanism. [ABSTRACT FROM AUTHOR]

Chaos influence different fields of science and technology. The development of sciences is at peak expected to the rapid broadcast of information with the smart machine in constrained resources atmosphere. With the help of our smartphone, we can easily access the information within no time and with much ease. This ease makes our information open and can be accessed from the web or misuse by any person. To secure our information on the internet of things (IOTs), lightweight cryptographic algorithms were introduced. We offered an efficient lightweight confusion component scheme constructed on the composition of chaotic iterative maps. The proposed chaotic lightweight substitution box (S-box) offers decent cryptographic characteristics. The suggested chaotic S-box is used for adding a confusion layer in small lightweight block cipher algorithms. The outcome of cryptographic characteristics displays that the anticipated chaotic Substitution box is appropriate for the lightweight block cipher in a constrained source environment. [ABSTRACT FROM AUTHOR]

The present article introduced a novel idea for information hiding namely steganography. We have used new notions for the construction of the nonlinear component for block cipher based on inverse LA-semigroups. This nonlinear component fundamentally provides confidentiality in the proposed steganographic algorithm. The construction of the algorithm is fundamentally twofold. Firstly, we have constructed a novel scheme to design confusion component namely substitution box (S-box). Secondly, we have utilized the anticipated nonlinear component in digital steganography. The suggested algorithm is tested for different standard digital images. The authentication of the proposed algorithm is confirmed through statistical analysis. [ABSTRACT FROM AUTHOR]

In this article, we have designed a new information confidentiality mechanism based on the combination of Blowfish encryption algorithm along with Henon and Chen chaotic dynamical systems. We have authenticated our proposed encryption algorithm over satellite and other standard digital images of image processing. Our proposed encryption algorithm is equally deployed as an encrtpter and decrypter while at the sending and receiving ends in satellite communication. In satellite communication, typical wireless mediums are used for transferring heavy payloads and usual telemetry. The priciple aim of this article is to design a new mechanism for the privacy of digital contents mainly satellite images. We have authenticated our anticipated mechanism with security performace analyses. [ABSTRACT FROM AUTHOR]

Recently many substitution box based encryption algorithms ensuring privacy have been proposed. Many, chaotic map based S-boxes have been generated posing high nonlinearity and strong cryptographic properties. Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. Cryptanalysis in both types of attacks is performed by only one selected image. Moreover, we have suggested some improvements in the algorithm to defeat attacks. • Recently many substitution box-based encryption algorithms ensuring privacy have been proposed. • Many, chaotic map-based substitution boxes (S-boxes) have been generated posing high nonlinearity and strong cryptographic properties. • Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. • In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. • Cryptanalysis in both types of attacks is performed by only one selected image. [ABSTRACT FROM AUTHOR]

Determining the location of the rupture source is the greatest advantage of the acoustic monitoring method, whose accuracy has a significant impact on monitoring the stability of complex rock mass environment. The traditional location method uses equivalent velocity to determine the source parameters generally, but equivalent velocity is a function relating to source and sensor position, and medium parameters, etc. For a complex rock mass environment, there might exist relatively large error using equivalent velocity to determine the source parameters. To improve the source location accuracy, the source location method based on Dijkstra's algorithm (SLMD) is studied in this paper, which can take full advantage of the velocity information in a complex rock mass environment. Based on SLMD location characteristics, a new source location method (Average Source Location Method, ASLM) is proposed. Combined with two-dimension plane layered models, it is inferred that the location accuracy of ASLM is evidently higher than SLMD. Even if SLMD with high-density grids is used, ASLM still has pronounced advantage of location accuracy and time complexity. For further validation of obtained results through ASLM and conclusions inferred, complex rock mass environment models are used in the laboratory experiment. The research results show that ASLM has a more evident advantage over the Simplex method and Double-Difference method under complex rock mass environments. This research provides a new source location method for the determination of the source parameters, which has significant theoretical and practical meaning for monitoring the stability of complex rock mass environment. [ABSTRACT FROM AUTHOR]

Boris numerical scheme due to its long-time stability, accuracy and conservative properties has been widely applied in many studies of magnetized plasmas. Such algorithms conserve the phase space volume and hence provide accurate charge particle orbits. However, this algorithm does not conserve the energy in some special electromagnetic configurations, particularly for long simulation times. Here, we empirically analyze the energy behavior of Boris algorithm by applying it to a 2D autonomous Hamiltonian. The energy behavior of the Boris method is found to be strongly related to the integrability of our Hamiltonian system. We find that if the invariant tori is preserved under Boris discretization, the energy error can be bounded for an exponentially long time, otherwise the said error will show a linear growth. On the contrary, for a non-integrable Hamiltonian system, a random walk pattern has been observed in the energy error. [ABSTRACT FROM AUTHOR]

In this article, our aim is to design a new and efficient digital information confidentiality mechanism. We have offered an encryption scheme which is based on fractals and multiple chaotic iterative maps in order to add more confusion and diffusion capability. Due to randomness nature and unique repetitive pattern of fractal increases key space to hundreds of bits and enhance security level of proposed cryptosystem. The projected algorithm is authenticated by utilizing security performance analyses. The security performances elucidate that our suggested technique is quite competent for digital image encryption. [ABSTRACT FROM AUTHOR]

Quantum information processing made a tremendous and remarkable impact on number of classical mechanic’s problems. The impact does not only stop at classical mechanics but also the cyber security paradigm. Quantum information and cryptography are two classes of quantum information processing which use the idea of qubits instead of bits as in classical information security. The idea of fast computations with multiple complexity level is becoming more realistic in the age of quantum information due to quantum parallelism where a single quantum computer does allow to compute hundreds of classical computers with less efforts and more accuracy. The evolution of quantum information processing replaces a number of classical mechanic’s aspects in computational and cyber security sciences. Our aim here is to introduce concepts of applied quantum dynamics in cryptography, which leads to an evolution of quantum cryptography. Quantum cryptography is one of the most astonishing solicitations of quantum information theory. To measure the quantum state of any system is not possible without disturbing that system. The facts of quantum mechanics on traditional cryptosystems lead to a new protocol and achieving maximum remarkable security for systems. The scope of this paper is to design an innovative encryption scheme for digital data based on quantum spinning and rotation operators. [ABSTRACT FROM AUTHOR]

Traditional and modern cryptosystems purely rely on mathematics and their algorithms based on fundamental process of factoring large integers into their primes, which is said to be intractable. But this type of cryptography vulnerable to both evolutions in mathematics and development of high computing power which can easily reverse one way functions. Now the requirement is to design a new mechanism whose reverse computation is not possible for any system. The robust security mechanism is necessary. The combination of quantum mechanism and cryptography make it possible to develop such a secure communication systems that utilized different energy spectra for the transmission of information. The combination of quantum mechanics and cryptography gives birth to quantum cryptography. Quantum cryptography is one of the most remarkable application of quantum information theory. To measure the quantum state of any system is not possible without disturbing that system. The facts of quantum mechanics on traditional cryptosystems leads to a new protocol, algorithms and achieving maximum security for systems. The aim of this article is to apply quantum spinning and rotation along with finite state machine to develop an efficient cryptosystems for text encryption and decryption. [ABSTRACT FROM AUTHOR]

In demand side management (DSM), scheduling of appliances based on consumer-defined priorities is an important task performed by a home energy management controller (HEMC). This paper presents a DSM technique that is capable of controlling loads within a smart home considering time-varying appliances’ priorities. An evolutionary accretive comfort algorithm (EACA) is developed based on four postulations that allow time-varying priorities to be quantified in time and device-based features. Based on the input data considering the appliances’ power ratings, its time of use, and absolute comfort derived from priorities, the EACA is able to generate an optimal energy consumption pattern which would give maximum satisfaction at a predetermined user budget. A cost per unit comfort index ( χ ) which relates the consumer expenditure to the achievable comfort is also demonstrated. To test the applicability of the proposed EACA, three budget scenarios of $1.5/day, $2.0/day and $2.5/day are performed. The results of each of the scenarios using EACA are compared to five base cases in which the appliances are randomly used. The simulation results revealed that the proposed EACA obtained an optimal absolute comfort with reduced cost per unit comfort values for all three scenarios within the budget limits. [ABSTRACT FROM AUTHOR]

ABSTRACT Seismic field data are often irregularly or coarsely sampled in space due to acquisition limits. However, complete and regular data need to be acquired in most conventional seismic processing and imaging algorithms. We have developed a fast joint curvelet-domain seismic data reconstruction method by sparsity-promoting inversion based on compressive sensing. We have made an attempt to seek a sparse representation of incomplete seismic data by curvelet coefficients and solve sparsity-promoting problems through an iterative thresholding process to reconstruct the missing data. In conventional iterative thresholding algorithms, the updated reconstruction result of each iteration is obtained by adding the gradient to the previous result and thresholding it. The algorithm is stable and accurate but always requires sufficient iterations. The linearised Bregman method can accelerate the convergence by replacing the previous result with that before thresholding, thus promoting the effective coefficients added to the result. The method is faster than conventional one, but it can cause artefacts near the missing traces while reconstructing small-amplitude coefficients because some coefficients in the unthresholded results wrongly represent the residual of the data. The key process in the joint curvelet-domain reconstruction method is that we use both the previous results of the conventional method and the linearised Bregman method to stabilise the reconstruction quality and accelerate the recovery for a while. The acceleration rate is controlled through weighting to adjust the contribution of the acceleration term and the stable term. A fierce acceleration could be performed for the recovery of comparatively small gaps, whereas a mild acceleration is more appropriate when the incomplete data has a large gap of high-amplitude events. Finally, we carry out a fast and stable recovery using the trade-off algorithm. Synthetic and field data tests verified that the joint curvelet-domain reconstruction method can effectively and quickly reconstruct seismic data with missing traces. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, the Laplace decomposition method (LDM) is proposed to solve the two-dimensional nonlinear Burgers’ differential equations. Two test problems are considered to illustrate the accuracy of the proposed algorithm. It is shown that the numerical results are in good agreement with the exact solutions for each problem. [Copyright &y& Elsevier]

In this article, we suggest modified Laplace decomposition method for analytical solution of eighth-order boundary value problems (BVPs). The numerical application indicates the effectiveness and stability of the proposed algorithm. The efficiency of proposed method is examined with the help of linear and nonlinear problems. [ABSTRACT FROM AUTHOR]

Abstract: The central idea of this paper is to construct a new mechanism for the solution of Abel’s type singular integral equations that is to say the two-step Laplace decomposition algorithm. The two-step Laplace decomposition algorithm (TSLDA) is an innovative adjustment in the Laplace decomposition algorithm (LDA) and makes the calculation much simpler. In this piece of writing, we merge the Laplace transform and decomposition method and present a novel move toward solving Abel’s singular integral equations. [Copyright &y& Elsevier]

Abstract: The chief aim of the present article is to introduce a new analytical technique, two-step Laplace decomposition method (TSLDM) for nonlinear Volterra integral equations. The newly proposed method efficiently find exact solution with less computation as compared with standard Laplace decomposition method (LDM). The proposed algorithm is used to solve nonlinear Volterra integral equations effectively and overcome the deficiencies in Laplace decomposition method (LDM) easily. [Copyright &y& Elsevier]

Rockburst is a serious hazard in underground engineering, and accurate prediction of rockburst risk is challenging. To construct an intelligent prediction model of rockburst risk with interpretability and high accuracy, three binary scorecards predicting different risk levels of rockburst were constructed using ChiMerge, evidence weight theory, and the logistic regression algorithm. An intelligent rockburst prediction model based on scorecard methodology (IRPSC) was obtained by integrating the three scorecards. The effects of hazard sample category weights on the missed alarm rate, false alarm rate, and accuracy of the IRPSC were analyzed. Results show that the accuracy, false alarm rate, and missed alarm rate of the IRPSC for rockburst prediction in riverside hydropower stations are 75%, 12.5%, and 12.5%, respectively. Setting higher hazard sample category weights can reduce the missed alarm rate of IRPSC, but it will lead to a higher false alarm rate. The IRPSC can adaptively adjust the threshold and weight value of the indicator and convert the abstract machine learning model into a tabular form, which overcomes the commonly black box problems of machine learning model, as well as is of great significance to the application of machine learning in rockburst risk prediction. [ABSTRACT FROM AUTHOR]

The use of real-time systems is growing at an increasing rate. This raises the power efficiency as the main challenge for system designers. Power asymmetric multicore processors provide a power-efficient platform for building complex real-time systems. The utilization of this efficient platform can be further enhanced by adopting proficient scheduling policies. Unfortunately, the research on real-time scheduling of power asymmetric multicore processors is in its infancy. In this research, we have addressed this problem and added new results. We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors. EDFwC=D-TS outclasses its counterparts in terms of system utilization. The simulation results show that EDFwC=D-TS schedules up to 67% more tasks with heavy workloads. Furthermore, it improves the processor utilization up to 11% and on average uses 14% less cores to schedule the given workload. [ABSTRACT FROM AUTHOR]

In this research article, we propose a new structure namely inverse left almost semigroup (LA-semigroup) by adding confusion in our proposed image encryption scheme along with discrete and continuous chaotic systems in order to complement the diffusion characteristics. The performance analysis was conducted in terms of the correlation analysis, the pixels uniformity analysis, the sensitivity analysis, the information entropy analysis, and pixels difference based measurements. The results show that the proposed algorithm has better information security properties, which can provide strong security and a high performance. [ABSTRACT FROM AUTHOR]