Author
Azman Samsudin
Other affiliations: University of Denver
Bio: Azman Samsudin is an academic researcher from Universiti Sains Malaysia. The author has contributed to research in topics: Encryption & Cryptography. The author has an hindex of 21, co-authored 128 publications receiving 1449 citations. Previous affiliations of Azman Samsudin include University of Denver.
Topics: Encryption, Cryptography, Block cipher, Chaotic, Steganalysis
Papers published on a yearly basis
Papers
More filters
TL;DR: Security and performance analysis indicates that the proposed scheme is highly resistant to various cryptanalytic attacks, is statistically superior and more secure than previously proposed chaos-based image ciphers.
277 citations
TL;DR: An enhancement to a tent map’s chaotic properties by hybridizing it with a deterministic finite state machine and proposing a new image encryption scheme based on TM-DFSM, capable of performing both confusion and diffusion operations in one pass while also having a flexible key space.
119 citations
TL;DR: A theoretical approach to capturing the essence of the artists' insight by introducing several aesthetic measures for graphic screens and demonstrating close relationships between artistic vision and the proposed measures.
Abstract: An important aspect of screen design is aesthetic evaluation of screen layouts. However, no one knows how to measure aesthetic value. This article proposes a theoretical approach to capturing the essence of the artists' insight. We introduce several aesthetic measures for graphic screens. The results of our informal study demonstrate close relationships between artistic vision and the proposed measures.
76 citations
TL;DR: Theoretical analysis and computer simulations confirm that the new algorithm possesses high security, robust fast encryption speed for practical image encryption and solves the problem of small key space.
Abstract: During the recent years several chaotic image encryption algorithms have been proposed, but most of them encountered some drawbacks such as small key space, low speed, lack of robustness and low security. In this paper, we have proposed an image algorithm based on the combination of a one-dimensional polynomial chaotic map and a piecewise nonlinear chaotic map. Theoretical analysis and computer simulations, both confirm that the new algorithm possesses high security, robust fast encryption speed for practical image encryption and solves the problem of small key space.
74 citations
TL;DR: In this study, a practical plain image recovery method is proposed, and it is shown that the images encrypted with the same key could easily be recovered using the suggested cryptanalysis method with as low as two chosen plain images.
Abstract: Recently an image encryption algorithm based on DNA encoding and the Elliptic Curve Cryptography (ECC) is proposed. This paper aims to investigate the security the DNA-based image encryption algorithm and its resistance against chosen plaintext attack. The results of the analysis demonstrate that security of the algorithm mainly relies on one static shuffling step, with a simple confusion operation. In this study, a practical plain image recovery method is proposed, and it is shown that the images encrypted with the same key could easily be recovered using the suggested cryptanalysis method with as low as two chosen plain images. Also, a strategy to improve the security of the algorithm is presented in this paper.
73 citations
Cited by
More filters
04 Oct 2019
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Abstract: Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian.In this paper a computational complexity theory of the “knowledge” contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity. These are the first examples of zero-knowledge proofs for languages not known to be efficiently recognizable.
1,962 citations
TL;DR: The study found that neural-network models such as feedforward and feedback propagation artificial neural networks are performing better in its application to human problems and proposed feedforwardand feedback propagation ANN models for research focus based on data analysis factors like accuracy, processing speed, latency, fault tolerance, volume, scalability, convergence, and performance.
1,471 citations
TL;DR: Simulations and performance evaluations show that the proposed system is able to produce a one-dimension (1D) chaotic system with better chaotic performances and larger chaotic ranges compared with the previous chaotic maps.
458 citations
TL;DR: A four-wing hyperchaotic system is used to provide pseudo-random chaotic sequences, SHA 384 hash function of the plain image and external parameters are combined to compute its initial values, and one-time-pad encryption policy makes the proposed encryption effectively resist plaintext attacks.
401 citations
01 Jan 1999
TL;DR: Several mechanisms for marking documents and several other mechanisms for decoding the marks after documents have been subjected to common types of distortion are described and compared.
Abstract: Each copy of a text document can be made different in a nearly invisible way by repositioning or modifying the appearance of different elements of text, i.e., lines, words, or characters. A unique copy can be registered with its recipient, so that subsequent unauthorized copies that are retrieved can be traced back to the original owner. In this paper we describe and compare several mechanisms for marking documents and several other mechanisms for decoding the marks after documents have been subjected to common types of distortion. The marks are intended to protect documents of limited value that are owned by individuals who would rather possess a legal than an illegal copy if they can be distinguished. We will describe attacks that remove the marks and countermeasures to those attacks. An architecture is described for distributing a large number of copies without burdening the publisher with creating and transmitting the unique documents. The architecture also allows the publisher to determine the identity of a recipient who has illegally redistributed the document, without compromising the privacy of individuals who are not operating illegally. Two experimental systems are described. One was used to distribute an issue of the IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, and the second was used to mark copies of company private memoranda.
329 citations