Agonistic behavior of captive saltwater crocodile, crocodylus porosus in Kota Tinggi, Johor

Agonistic behavior in Crocodylus porosus is well known in the wild, but the available data regarding this behavior among the captive individuals especially in a farm setting is rather limited. Studying the aggressive behavior of C. porosus in captivity is important because the data obtained may contribute for conservation and the safety for handlers and visitors. Thus, this study focuses on C. porosus in captivity to describe systematically the agonistic behaviour of C. porosus in relation to feeding time, daytime or night and density per pool. This study was carried out for 35 days in two different ponds. The data was analysed using Pearson’s chi-square analysis to see the relationship between categorical factors. The study shows that C. porosus was more aggressive during daylight, feeding time and non-feeding time in breeding enclosure (Pond C, stock density =0.0369 crocodiles/m2) as compared to non-breeding pond (Pond B, stock density =0.3317 crocodiles/m2) where it is only aggressive during the nighttime. Pond C shows the higher domination in the value of aggression in feeding and non-feeding time where it is related to its function as breeding ground. Chi-square analysis shows that there is no significant difference between ponds (p=0.47, χ2= 2.541, df= 3), thus, there is no relationship between categorical factors. The aggressive behaviour of C. porosus is important for the farm management to evaluate the risk in future for the translocation process and conservation of C. porosus generally

Law, Metaphor, and the Encrypted Machine

The metaphors we use to imagine, describe, and regulate new technologies have profound legal implications. This article offers a critical examination of the metaphors we choose to describe encryption technology and aims to uncover some of the normative and legal implications of those choices. The article begins with a basic technical backgrounder and reviews the main legal and policy problems raised by strong encryption. Then it explores the relationship between metaphor and the law, demonstrating that legal metaphor may be particularly determinative wherever the law seeks to integrate novel technologies into old legal frameworks. The article establishes a loose framework for evaluating both the technological accuracy and the legal implications of encryption metaphors used by courts and lawmakers—from locked containers, car trunks, and combination safes to speech, shredded letters, untranslatable books, and unsolvable puzzles. What is captured by each of these cognitive models, and what is lost

Hyperchaotic technology-based efficient image encryption algorithm an overview.

Multimedia data encryption is so crucial because the multimedia encryption algorithm needs more time and memory, and it is difficult to implement. Because of this, the hyperchaotic image encryption technique is becoming more and more popular, which uses little memory, time, or energy and offers the highest level of security for low-powered devices. This study offers a comprehensive overview of modern hyperchaotic systems. By focusing on these complex systems' uniqueness and fundamental features, a study of their dynamic behavior is offered. Such systems are now being used more and more in a variety of industries, including finance, secure communication, and encryption, for example. In reality, every field calls for particular performances of unusual complexity. This research then suggests a specific classification based on the crucial hyperchaotic characteristic, Lyapunov exponent, the equilibrium points, dynamical behavior, NPCR, and UACI.

HARPOCRATES: An Approach Towards Efficient Encryption of Data-at-rest

This paper proposes a new block cipher called HARPOCRATES, which is different from traditional SPN, Feistel, or ARX designs. The new design structure that we use is called the substitution convolution network. The novelty of the approach lies in that the substitution function does not use fixed S-boxes. Instead, it uses a key-driven lookup table storing a permutation of all 8-bit values. If the lookup table is sufficiently randomly shuffled, the round sub-operations achieve good confusion and diffusion to the cipher. While designing the cipher, the security, cost, and performances are balanced, keeping the requirements of encryption of data-at-rest in mind. The round sub-operations are massively parallelizable and designed such that a single active bit may make the entire state (an 8 × 16 binary matrix) active in one round. We analyze the security of the cipher against linear, differential, and impossible differential cryptanalysis. The cipher’s resistance against many other attacks like algebraic attacks, structural attacks, and weak keys are also shown. We implemented the cipher in software and hardware; found that the software implementation of the cipher results in better throughput than many well-known ciphers. Although HARPOCRATES is appropriate for the encryption of data-at-rest, it is also well-suited in data-in-transit environments

Entropy in Image Analysis II

Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas

A comparative study of steganography using watermarking and modifications pixels versus least significant bit

This article presents a steganography proposal based on embedding data expressed in base 10 by directly replacing the pixel values from images red, green blue (RGB) with a novel compression technique based on watermarks. The method considers a manipulation of the object to be embedded through a data compression triple process via LZ77 and base 64, watermark from low-quality images, embedded via discrete wavelet transformation-singular value decomposition (DWT-SVD), message embedded by watermark is recovered with data loss calculated, the watermark image and lost data is compressed again using LZ77 and base 64 to generate the final message. The final message is embedded in portable network graphic (PNG) images taken from the Microsoft common objects in context (COCO), ImageNet and uncompressed color image database (UCID) datasets, through a filtering process pixel of the images, where the selected pixels expressed in base 10, and the final message data is embedded by replacing units’ position of each pixel. In experimentation results an average of 40 dB in peak signal noise to ratio (PSNR) and 0.98 in the similarity structural index metric (SSIM) evaluation were obtained, and evasion steganalysis rates of up to 93% for stego-images, the data embedded average is 3.2 bpp

ROLE OF GIS IN RESIDENTIAL MICROGRID

Master'sMASTER OF ENGINEERIN

Robust Lossless Semi Fragile Information Protection in Images

Internet security finds it difficult to keep the information secure and to maintain the integrity of the data. Sending messages over the internet secretly is one of the major tasks as it is widely used for passing the message. In order to achieve security there must be some mechanism to protect the data against unauthorized access. A lossless data hiding scheme is proposed in this paper which has a higher embedding capacity than other schemes. Unlike other schemes that are used for embedding fixed amount of data, the proposed data hiding method is block based approach and it uses a variable data embedding in different blocks which reduces the chances of distortion and increases the hiding capacity of the image. When the data is recovered the original image can be restored without any distortion. Our experimental results indicate that the proposed solution can significantly support the data hiding problem. We achieved good Peak signal-to-noise ratio (PSNR) while hiding large amount of data into smoother regions