Selama komunikasi teknologi terus berkembang, keamanan informasi menjadi sangat penting karena kejahatan di dunia maya semakin marak terjadi. Untuk meningkatkan informasi, pada penelitian ini dikonstruksi penggabungan kriptografi secret sharing scheme (t, w) dengan steganografi audio least significant bit (LSB). Kriptografi merupakan modern yang mampu mencegah terjadinya situasi terpusat tidak ...

Scalar quantization is the most practical and straightforward approach to signal quantization. However, it has been shown that scalar quantization of oversampled or Compressively Sensed signals can be inefficient in terms of the rate-distortion trade-off, especially as the oversampling rate or the sparsity of the signal increases. Recent theoretical work has provided some insights on improving ...

In this paper, an improved GEF fast addition algorithm is proposed. The proposed algorithm reduces time and memory space. In this algorithm, carry is calculated on the basis of arrival timing of the operand’s bits without overhead of sorting. Intermediate terms are generated from the most significant bit and the carry is generated from the least significant bit using the functions of efficient ...

This paper presents high-speed low-power small-area accumulator designs to be used in DDFS systems. To reduce the Numerically Controlled Oscillator (NCO) design complexity and size, only the most significant bits of the accumulator drive the phase to amplitude mapping block. Those bits need to be updated on every sampling clock, while the least significant bits of the accumulator are not visibl...

This paper presents three new attacks on the RSA cryptosystem. The first two attacks work when k RSA public keys (Ni, ei) are such that there exist k relations of the shape eix−yiφ(Ni) = zi or of the shape eixi − yφ(Ni) = zi where Ni = piqi, φ(Ni) = (pi − 1)(qi − 1) and the parameters x, xi, y, yi, zi are suitably small in terms of the prime factors of the moduli. We show that our attacks enabl...

To develop and check the Steganography based information’s by using Matlab this proposal investigates the detection of information hidden in digital media by both the least significant bit (LSB) matching and replacement scheme. Which can completely recover the original images without any distortion from the secret images by utilizing the parity features of the original images and defining two e...

We introduce the class MP of languages L which can be solved in polynomial time with the additional information of one bit from a #P function f . We prove that the polynomial hierarchy and the classes ModkP, k ≥ 2, are low for this class. We show that the middle bit of f(x) is as powerful as any other bit, and that a wide range of bits around the middle have the same power. By contrast, the O(l...

The FFT performs butterfly computations on pairs of data elements that differ in a single bit. The computations start from the most significant bit in the index space and proceeds monotonically to the least significant bit. In a binary cube, adjacent nodes differ in a single bit in their addresses. Thus, mapping data to nodes by a binary encoding of the indices is suitable for the FFT. We assum...