The problem the researchers set out to address is one of the most pressing in modern digital media. Forged images are now a critical issue in the transmission of multimedia information, and detection strategies have traditionally split into two broad families. Statistical pixel-based models look for mathematical fingerprints left by editing operations, such as anomalies in compression artifacts, sensor noise patterns, or resampling traces. Physics-based strategies, by contrast, depend on physical indications like illumination direction, shading, reflection, and shadows. The second family has a powerful advantage: a forger can remove statistical traces with enough care, but it is far harder to fabricate a shadow geometry that is fully consistent with the lighting of a scene the object never actually occupied.

Yet physics-based methods have carried a well-known weakness. Standard gradient-based illumination assessment, which estimates the direction of light from the shading gradients on object surfaces, runs into serious limitations and challenges once shadows are present in the image. The difficulty becomes especially severe when objects cast shadows onto one another. In a cluttered scene, a person’s shadow may fall across a wall, a car, and another person simultaneously, and these overlapping shadows lead gradient-based estimators to produce varying or confusing outcomes. The illumination directions inferred from different objects can appear inconsistent even in a completely genuine photograph, generating false alarms that undermine the credibility of the entire forensic analysis.

The new technique tackles this failure mode head-on with a geometric construction the authors call wedge-based shadow analysis. The method begins by selecting key shadow points in the image, the salient locations where shadows attach to or extend from the objects that formed them. Angular wedges are then drawn between these shadow points and their probable forming objects. Each wedge is a cone of possible directions in the image plane, capturing the geometric relationship between an object, the shadow it casts, and the position of the light source that must connect them. Because a single light source must lie within every wedge derived from every consistent object-shadow pair in the scene, the wedges collectively constrain where the illumination can be.

The decision rule that follows is elegantly simple. Linear constraints are applied using these wedges, and the presence of an intersection between their standard limits determines the illumination direction. If the wedges all share a common region, the lighting implied by every shadow in the image agrees, and the image is judged consistent with a single physical light source. Consistency across the wedges therefore represents a genuine image, whereas inconsistency, the failure of the wedges to converge on a shared illumination direction, demonstrates a forgery sample. In other words, a spliced object whose shadow was copied from a differently lit scene will generate a wedge that points somewhere no other wedge in the image points, and the intersection test catches the contradiction.

This approach directly addresses the scenario that breaks gradient-based methods. When objects cast shadows onto each other, the wedges provide a way to reason about the collective geometry of the scene rather than relying on local shading estimates that overlapping shadows contaminate. The angular construction tolerates the ambiguity inherent in any single shadow, which spans a range of possible light positions, while exploiting the fact that a forger’s mistakes accumulate across multiple shadows. A genuine scene with many interlocking shadows still yields wedges that overlap; a composite does not, because the attacker would need to re-render every shadow in the image under a single coherent lighting model to pass the test.

The experimental evaluation used the DSO-1 dataset, a publicly available benchmark containing 44 images, both indoor and outdoor, all featuring shadows. The dataset includes both genuine photographs and manipulated ones, making it a standard proving ground for shadow-based forensics. On this benchmark, the wedge-based model achieved a detection accuracy of 58.73 percent for outdoor images and 67.58 percent for indoor images. The indoor advantage is intuitive: interior scenes tend to have more controlled, single-source lighting, which makes the wedge intersections cleaner and the consistency test more discriminating. Outdoor scenes, with diffuse skylight and multiple environmental light contributions, present a harder geometric puzzle.

Perhaps the most striking result concerns a specific and practically important subset of the data. For genuine outdoor images featuring shadows among objects, the scenes where shadows overlap and objects shade one another, the method reached a potential performance of 82 percent. That figure matters because these overlapping-shadow scenes are precisely the cases where the technique was designed to outperform gradient-based illumination assessment, which tends to produce confusing or contradictory estimates under the same conditions. The result suggests that the wedge formulation converts the very complication that defeats earlier methods, mutual shadow casting, into a source of additional geometric constraints that strengthen the authenticity verdict.

The study situates itself within a rich lineage of physics-based forensics research. Earlier work established that inconsistencies in lighting expose digital forgeries, that shading and shadows can be analyzed jointly to detect manipulation, and that reflection inconsistencies offer a complementary signal. Gradient-based illumination description was developed specifically for forgery detection, and other researchers have pursued optimized three-dimensional lighting environment estimation, linear constraints based on shading and shadows, Lambert model analysis with shadows, and shadow consistency checks using color-space features such as HSV. The wedge technique extends this tradition by targeting the multi-object, mutually shadowing scenes that constrained many of its predecessors, and the authors position it as a viable solution for handling the challenges of gradient-based illumination assessment in difficult real-world scenarios.

The broader significance of the work lies in the ongoing arms race between image manipulation and image verification. As generative tools make convincing composites trivially easy to produce, forensic science increasingly depends on cues that are expensive to fake. Shadows are among the most demanding of these cues, because getting them right requires not just artistic skill but a physically accurate understanding of the scene’s lighting geometry. A method that reads the angular relationships between objects and their shadows, and that remains robust when those shadows interlock, adds a meaningful layer of defense. The authors’ findings, drawn from a modest but well-established benchmark, indicate that wedge-based shadow analysis can serve as a practical component in the forensic toolkit, complementing statistical detectors and metadata analysis. For editors, journalists, courts, and platforms confronting a daily flood of questionable imagery, the message is a compelling one: the light in a photograph always tells the truth, and now there is a more reliable way to make the shadows testify.

Subject of Research: Physics-based image forgery detection using wedge-based analysis of object shadows and illumination consistency

Article Title: Illuminating authenticity using deciphering image forgery through scene object shadow analysis

Article References: Surve, D., & Nimkar, A. (2026). Illuminating authenticity using deciphering image forgery through scene object shadow analysis. Multimedia Tools and Applications, 85(10), Article 801. https://doi.org/10.1007/s11042-026-21956-6

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21956-6

Keywords: image forgery detection, shadow analysis, digital forensics, illumination direction, physics-based methods, wedge-based analysis, DSO-1 dataset, photo manipulation, computer vision, image authentication, multimedia security, lighting consistency

The scheme, developed by El Mahdi Mouloua and colleagues, rests on two novel operators that work in tandem. The first is a chaotic polycyclic shift, denoted by the Greek letter phi with a chaotic vector index, which generalizes the familiar left and right bit rotations used in classical cryptography. Instead of shifting data by a fixed amount, the operator displaces pixels and their bits by amounts dictated by a chaotic sequence, so that the pattern of movement never repeats and cannot be predicted without the secret key. This operator drives the confusion mechanism of the cipher, scrambling the relationship between the original image and its encrypted form.

The second operator addresses the other pillar of strong encryption: diffusion. In cryptographic terms, confusion hides the connection between the key and the ciphertext, while diffusion ensures that a change to a single element of the plaintext spreads throughout the entire encrypted output. The researchers call their diffusion engine the chaotic avalanche effect, symbolized by xi. It creates a strong binding between each encrypted pixel and the following original pixel, so that information from one part of the image cascades into the encryption of subsequent parts. A single flipped bit in the input therefore triggers an avalanche of changes across the ciphertext, denying attackers the ability to modify localized regions of an image undetected.

The intellectual roots of the work reach into an unexpected corner of mathematics: the theory of polycyclic codes. One of the co-authors, Oussama Kabbouch, had previously explored the algebraic structure of polycyclic codes with collaborators, building on earlier generalizations of cyclic codes introduced by Lopez-Permouth, Parra-Avila and Szabo in 2009. By importing the cyclic shift idea from coding theory into the chaotic domain, the team transformed a static algebraic operation into a dynamic, key-dependent one. The chaotic vector that steers the shift is generated by chaotic maps, whose extreme sensitivity to initial conditions means that even a minute difference in the key produces a completely different scrambling pattern.

Chaos theory has long fascinated cryptographers for precisely this reason. Chaotic systems, such as the logistic map and its more elaborate relatives like the intertwining logistic map, exhibit deterministic but seemingly random behavior. Their trajectories never settle into a pattern, yet they can be reproduced exactly by anyone holding the same initial values. This combination of reproducibility and unpredictability makes them natural candidates for generating the keystreams and permutation sequences that encryption demands. The new scheme taps this property to control both the polycyclic shifts and the avalanche diffusion, ensuring that every stage of the cipher is driven by the same chaotic engine and the same secret key material.

The experimental evaluation reported in the paper reads like a checklist of modern cryptographic benchmarks, and the scheme passes each one. The key space, which measures how many possible secret keys an attacker would need to brute-force, is described as large, a critical property given that many published chaotic ciphers have been broken because their key spaces proved too small. Key sensitivity is similarly high: encrypting the same image with keys that differ by a single digit yields entirely different ciphertexts, which prevents an attacker from gleaning information through near-miss keys.

Statistical tests on the encrypted images tell a similar story. The histograms of the encrypted outputs are uniform, meaning that every pixel value appears with equal frequency and no statistical fingerprint of the original image survives. The correlation between adjacent pixels, which in natural images is typically very high because neighboring pixels tend to look alike, drops to low values in the ciphertext, destroying the structural redundancy that attackers exploit in known-plaintext and chosen-plaintext attacks. Information entropy, a measure of randomness, reaches high values close to the theoretical maximum of eight bits per pixel for eight-bit images, indicating that the encrypted data is essentially indistinguishable from noise.

Two additional metrics, standard in the image encryption literature, quantify the scheme’s resistance to differential attacks. The number of pixels change rate, or NPCR, measures the fraction of pixels that change when the plaintext is altered by a single bit, while the unified average changing intensity, or UACI, measures the average strength of those changes. Ideal values are close to 99.6 percent and 33.4 percent respectively, and the reported strong encryption performance of the scheme, together with low peak signal-to-noise ratio values between original and encrypted images, indicates that the chaotic avalanche effect delivers the full diffusion strength needed to defeat these attacks. Low PSNR here is a virtue: it confirms that the encrypted image leaks essentially nothing about the original.

The broader context makes the contribution timely. The literature is littered with image encryption schemes that looked impressive on paper but collapsed under cryptanalysis, including DNA-based ciphers and designs built on the two-dimensional logistic-adjusted-sine map, both of which were broken by dedicated attacks. Meanwhile the demand for image security keeps growing, driven by telemedicine platforms transmitting diagnostic scans, the Industrial Internet of Things streaming visual sensor data, and cloud storage services holding vast archives of personal photographs. Recent research has explored hyperchaotic maps, memristive neural networks, quantum walks and DNA encoding as ingredients for next-generation ciphers, and the Moroccan-Romanian team positions its polycyclic approach within this competitive landscape, arguing that a mathematically grounded shift operator offers a cleaner and more principled confusion mechanism than ad hoc permutation tricks.

The researchers, who contributed equally to the work alongside co-authors from institutions in Morocco and Romania, suggest that the combination of a generalized cyclic structure with chaotic dynamics could extend beyond still images, potentially informing the protection of video streams and other multimedia content where efficiency and security must coexist. For now, the scheme stands as a demonstration that classical algebra and modern chaos theory can be fused into a cipher that is more than the sum of its parts: a system in which the ancient idea of the cyclic shift is reborn, steered by randomness that only the legitimate key holder can reproduce, and in which every pixel of an image guards the secrets of every other.

Subject of Research: Chaotic image encryption using polycyclic shift operators

Article Title: Design of a secure image encryption scheme using chaotic polycyclic shift

Article References: Mouloua, E. M., Ben-Hdech, A., Bejan, C. A., Es-Sabry, M., Najmeddine, M., Kabbouch, O., Bucerzan, D., & Essaid, M. (2026). Design of a secure image encryption scheme using chaotic polycyclic shift. Cluster Computing, 29(13), Article 771. https://doi.org/10.1007/s10586-026-06588-7

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06588-7

Keywords: image encryption, chaos theory, polycyclic codes, cryptography, confusion and diffusion, chaotic maps, multimedia security, NPCR, UACI, information entropy, Cluster Computing, data security

The core idea of the framework is deceptively simple in outline but intricate in execution. Every audio recording, once digitized, is a long sequence of numbers representing the amplitude of the sound wave at successive instants. The researchers first map these quantized samples into a prime finite field, choosing the prime q equal to 65,537, a number large enough to hold high-resolution audio samples comfortably. Once the samples live in this field, every encryption operation becomes a modular arithmetic computation: additions, multiplications, and permutations all performed modulo q. This choice gives the scheme two crucial properties at once. Modular arithmetic is fast to compute, which matters enormously for real-time audio, and it is invertible in a fully algebraic sense, meaning the authors can write down an explicit mathematical inverse for the entire encryption pipeline.

Security in the scheme comes from a second-order nonlinear recurrence that generates a keystream, a long sequence of pseudo-random-looking field elements derived from secret parameters and a session-dependent nonce. Because the recurrence is nonlinear and session-specific, two identical recordings encrypted in different sessions produce entirely different ciphertexts, a property that frustrates attackers looking for repeated patterns across intercepted files. The authors deliberately frame the security contribution carefully: with six secret recurrence parameters and one multiplicative parameter, the nominal parameter-combination space for q equal to 65,537 is approximately two to the power of 112. They are explicit, however, that this is a count of possible parameter settings, not a certified measure of effective cryptographic strength against adversarial attack, a distinction that honest cryptography research increasingly insists upon.

Once the keystream is generated, the actual encryption unfolds in several coordinated stages. A two-round nonlinear pairwise transformation mixes adjacent samples in a way that depends on the keystream, followed by a multiplicative scrambling stage that rearranges the positions of samples throughout the file. Then comes the part the authors single out as doing the heaviest lifting: forward and backward nonlinear diffusion passes, in which each sample is algebraically combined with its neighbors and with keystream values so that a change to any single input sample cascades across the whole file, followed by two invertible global diffusion stages that ensure the mixing reaches every element of the ciphertext. The forward and backward passes together guarantee that perturbations propagate in both directions along the audio stream, leaving no region of the signal untouched.

The payoff of this layered design is measured in experiments. The researchers evaluated the system on publicly available audio signals and report exact reconstruction of the quantized finite-field representation, meaning the decryption algorithm recovers the encrypted numbers perfectly with no loss. Recovering the original real-valued audio waveform is subject only to the quantization introduced when the continuous sound wave was first mapped into the field, a limitation inherent to digitization itself rather than to the encryption. This exact algebraic invertibility is a genuine design achievement; many chaotic and diffusion-based audio encryption schemes in the literature struggle with numerical round-off errors that make perfect recovery impossible, forcing lossy reconstruction.

Statistical and differential tests add further evidence that the ciphertext is well-behaved. The encrypted files exhibit favorable statistical characteristics, appearing indistinguishable from random data in the metrics the authors examined, which denies an eavesdropper the frequency and amplitude fingerprints that unencrypted audio always carries. Sensitivity experiments demonstrated that minuscule perturbations of the secret recurrence parameters produce substantial changes in the generated keystream, so an attacker who guesses the key almost right is still no better off than one who guesses wildly. Ablation experiments, in which individual stages of the pipeline were removed, showed that the recursive and global diffusion stages make the major contributions to perturbation propagation, confirming that the architecture is not carrying dead weight and that each layer earns its computational cost.

Practicality was tested as rigorously as security. Both encryption and decryption run in linear asymptotic time, O(N) in the number of samples, meaning the cost grows in direct proportion to the length of the audio rather than exploding for longer files. The authors experimentally characterized execution time, throughput, working-memory requirements, and scalability, painting a picture of a scheme light enough for streaming and embedded contexts. For audio, where files can contain hundreds of thousands of samples per second of recording, linear complexity with modest memory is the difference between an academic curiosity and something an engineer could actually deploy. The modular arithmetic involved, consisting of additions and multiplications modulo a single 17-bit prime, maps cleanly onto ordinary processor instructions without the need for exotic hardware support.

The study situates itself within a crowded but rapidly evolving field. Audio encryption research has ranged from selective encryption of compressed streams, in which only perceptually critical parts of an MP3 are scrambled, to chaotic-map schemes using Arnold cat maps, hyperchaotic systems, DNA coding, elliptic curve cryptography, and ElGamal constructions over finite fields. Recent work has pushed toward hardware implementations on FPGA platforms and biologically inspired encoding schemes. The authors cite a broad sweep of this literature, from early MP3 delivery security methods through 2025 and 2026 publications on statistical-attack-resistant systems and quaternary logic approaches. Their contribution to this landscape is a fully specified, reproducible finite-field framework in which every operation is explicitly invertible and every design choice is subject to empirical ablation, in contrast to designs whose security rests on loosely characterized chaos.

The researchers are candid about the scope of their claims. The nominal parameter space of roughly two to the 112 is presented as a count of settings, not as validated key strength, and the reconstruction guarantee applies to the quantized representation rather than the analog waveform. The authors received no specific funding for the research and declare no competing interests. Corresponding author Perumal R. and first author Jimona J. J. shared the work between them, with the first author handling conceptualization, methodology, software, and the original draft, and the second author contributing supervision, investigation, and review. The article was received in March 2026, revised in August, accepted in September, and published on 19 September 2026 as article 769 in volume 85 of the journal.

What the study ultimately offers is a template: a way of thinking about audio security as a problem in finite-field algebra rather than as an application of image-style ciphers to sound. By insisting on explicit inverses, quantifying which stages actually drive diffusion, and publishing performance characteristics alongside security metrics, the work sets a standard of reproducibility that the field of multimedia encryption has often lacked. As voice content becomes a dominant carrier of sensitive information, from banking commands to clinical notes, frameworks of this kind, rigorously specified and empirically stress-tested, will be the raw material from which deployable audio security systems are built. Whether the scheme withstands dedicated cryptanalysis in open review remains to be seen, but its transparency invites exactly that scrutiny, and that may be its most valuable feature of all.

Subject of Research: A finite-field audio encryption framework based on nonce-dependent nonlinear recurrence, multiplicative scrambling, and recursive diffusion over a prime finite field.

Article Title: Finite-field audio encryption based on nonlinear modular recurrence and recursive diffusion

Article References: Finite-field audio encryption based on nonlinear modular recurrence and recursive diffusion. (n.d.). https://doi.org/10.1007/s11042-026-21931-1

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21931-1

Keywords: audio encryption, finite fields, nonlinear recurrence, modular arithmetic, keystream generation, recursive diffusion, multimedia security, cryptology, quantized audio, differential propagation, linear complexity, chaotic systems

The core problem the researchers tackle is a familiar one in multimedia security: fragile watermarking. In a fragile watermarking scheme, a small amount of auxiliary data is embedded into the pixels of an image before it is distributed. If someone later modifies the image, the embedded data no longer matches the modified content, and the mismatch reveals the tampering. The difficulty is that conventional schemes often localize tampering only approximately, and they frequently fail to recover the altered content, particularly when the attacker tampers with large regions or when the embedding strategy itself creates ambiguities about which blocks are authentic and which are not.

The new framework begins with tamper detection, and this is where perfect hashing enters the picture. Hash functions compress data into short index values that act like fingerprints; a cryptographic hash is designed so that two different inputs almost never produce the same output. In image authentication, however, the fingerprints must be embedded inside the image itself, which forces them to be very short, and short fingerprints are prone to collisions, situations in which two different image blocks produce identical authentication codes. A collision is dangerous because an attacker can swap the contents of two blocks that share the same code, and the tampering would go undetected. To close this loophole, the team introduces a rehashing-based perfect hashing mechanism built on Schur decomposition. In linear algebra, the Schur decomposition factors a matrix into a unitary transformation and an upper triangular matrix, and the researchers exploit this structure to generate collision-resistant indices for encoding authentication information. Under the random mapping conditions that arise during block-based embedding, the rehashing process ensures that each block receives a unique, verifiable index, dramatically improving the reliability of tamper localization.

Detecting tampering, however, is only half of the task. The second half is recovery, and for that the embedded watermark must carry enough information to reconstruct the original content of any region that comes under attack. Encoding a full image inside itself is impossible, so the team relies on compression. They use the Set Partitioning in Hierarchical Trees algorithm, or SPIHT, a well-established embedded wavelet coding technique that exploits the tree structure of wavelet coefficients to represent image content efficiently. SPIHT produces a compact, progressively refinable bitstream, which means the most visually important information about an image is encoded first and can be represented in very few bits. By embedding SPIHT-encoded recovery data alongside the authentication bits, the scheme ensures that every tampered block carries within its neighbors, or in blocks elsewhere in the image, a compact description of what the original content looked like.

The clever architectural move is that both the authentication data and the recovery data travel together inside a single watermark payload. The two streams are jointly embedded into the host image through an adaptive matrix-guided watermarking strategy. The matrix coding mechanism organizes the image into a structured array of blocks and determines, adaptively, where and how to place the payload so that the embedding capacity is maximized while the visual distortion of the watermarked image remains imperceptible. The word adaptive matters here: rather than applying a uniform embedding rule everywhere, the scheme balances the competing demands of payload size and image quality, deciding how many bits can be hidden in each region without degrading the picture in ways a human viewer or statistical analysis could detect.

When a suspicious image arrives at the verification stage, the process runs in reverse. The receiver recomputes the perfect-hashing indices for each block, compares them with the embedded authentication codes, and flags the blocks where the two disagree as tampered. Because the indices are collision-resistant, the localization is precise, and false alarms caused by index duplication are largely eliminated. The receiver then extracts the SPIHT-encoded recovery bitstream from the intact portions of the image and uses it to reconstruct the content of the flagged regions. The term successive recovery refers to the ability of the scheme to keep refining and restoring tampered areas even when the tampering is extensive, working progressively through the image rather than giving up once a critical fraction of blocks has been corrupted.

Extensive experiments reported in the paper demonstrate that the proposed scheme outperforms representative fragile watermarking-based image authentication methods on both localization accuracy and recovery quality, while maintaining satisfactory perceptual fidelity of the watermarked image. In practice, this means fewer tampered blocks escape detection, fewer authentic blocks are wrongly accused, and the reconstructed regions retain more of their original visual content than with competing approaches. The experiments were conducted on standard grayscale test images drawn from the publicly available USC-SIPI Image Database, providing a common benchmark that allows fair comparison with earlier schemes in the literature.

The significance of this work extends beyond an incremental improvement in watermarking metrics. Images now serve as evidence in courts, as inputs to artificial intelligence systems, as medical records, and as news documents consumed by billions of people. As generative tools make manipulation easier and harder to spot by eye, self-authenticating images that can diagnose and repair their own damage offer a form of defense that does not depend on external databases, trusted third parties, or the availability of the original file. The image carries its own certificate of integrity and its own repair kit, and both travel with it wherever it goes.

The research was carried out by Xuejing Li, Jingmin Pan, Tingting Wang, and Fei Cheng of the Anhui Institute of Information Technology in Wuhu, China, with Fei Cheng also affiliated with Hangzhou Dianzi University and Qimin Zhou of Anhui University contributing to experimental verification. Cheng serves as the corresponding author. The work was supported by the Planned Self-financed Project of Wuhu, the Key Project of Higher Education Research of the Anhui Provincial Department of Education, the Anhui Provincial Department of Education College Talent Project, and the Software and System Engineering Research Center of Smart Car at AIIT. The article was received in May 2026, revised in July, accepted in August, and published on 11 September 2026 in volume 85 of Multimedia Tools and Applications as article number 752. As digital forensics races to keep pace with increasingly sophisticated manipulation tools, schemes like this one, which fuse ideas from data structures, matrix analysis, and wavelet compression into a single self-protecting image format, point toward a future in which the question is no longer simply whether a photograph can be trusted, but whether it can heal itself when that trust is broken.

Subject of Research: Image authentication framework using perfect hashing and matrix coding for tamper detection and successive self-recovery of digital images

Article Title: Successive recovery of tampered regions based on perfect hashing and matrix coding mechanism

Article References: Li, X., Pan, J., Wang, T., Cheng, F., & Zhou, Q. (2026). Successive recovery of tampered regions based on perfect hashing and matrix coding mechanism. Multimedia Tools and Applications, 85(9), Article 752. https://doi.org/10.1007/s11042-026-21881-8

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21881-8

Keywords: image authentication, digital watermarking, tamper detection, image self-recovery, perfect hashing, SPIHT, fragile watermarking, matrix coding, Schur decomposition, multimedia security, image forensics, data hiding