Security of Digital Images Based on 3D Arnold Cat Map and Elliptic Curve

2020 ◽  
pp. 2150006
Author(s):  
Anand B. Joshi ◽  
Dhanesh Kumar ◽  
D. C. Mishra
Keyword(s):  
Elliptic Curve ◽  
Color Image ◽  
Three Dimensional ◽  
Mapping Method ◽  
Digital Data ◽  
Arnold Cat Map ◽  
Image Pixels ◽  
Dual Encryption ◽  
Digital Image Encryption ◽  
Encryption Method

Security of digital data is an important task in the present era. In this paper, we propose a new scheme of digital image encryption and decryption method based on three-dimensional (3D) Arnold cat map (ACM) and elliptic curve. In this proposed encryption method, we have applied 3D ACM on the digital color image which performs the dual encryption first, it performs the permutation and second, it performs the substitution of image pixels. After that, elliptic curve cryptography (ECC) is used to encrypt the image, for this a mapping method is proposed to convert the pixels of the image as points on the elliptic curve. Further, a mapping inverting method is proposed for decryption and then 3D inverse Arnold cat map (iACM) is applied to get the original image. The statistical and security analyses are done on various images and the experimental results show the robustness of the proposed method.

scholarly journals Hybrid Encryption Model Based on Advanced Encryption Standard and Elliptic Curve Pseudo Random

2021 ◽  
Author(s):  
Amal Hafsa ◽  
Mohamed Gafsi ◽  
Jihene Malek ◽  
Mohsen Machhout
Keyword(s):  
Elliptic Curve ◽  
Image Encryption ◽  
Color Image ◽  
Security Analysis ◽  
Advanced Encryption Standard ◽  
The Public ◽  
Suggested Technique ◽  
Cryptographic System ◽  
Point G ◽  
Encryption Method

Securing multimedia applications becomes a major challenge with the violation of the information increasing currently. In this paper, a novel method for color image encryption is proposed. The procedure of encryption is performed using cooperation between Elliptic Curve Cryptography (ECC) and the Advanced Encryption Standard (AES) with CTR (Counter) mode. In the cryptographic system, we have proposed to take advantage of the Elliptic Curve Random Generator to generate a sequence of arbitrary numbers based on the curve. The random generation step is founded on the public key sharing and a changing point G. Then, the AES-CTR is performed to these sequences using arbitrary keys for image encryption. The use of the AES alongside greatly distributed random results an interesting encryption method. Security analysis is successfully performed and our experiments prove that the suggested technique provides the basis of cryptography with more simplicity and correctness.

Detection, Averaging, and 3D Reconstruction of Biological Specimens on Hypercubes (Transputer-based) Computers

1990 ◽  
Vol 48 (1) ◽  
pp. 454-455
Author(s):  
Jose-Maria Carazo ◽  
I. Benavides ◽  
S. Marco ◽  
J.L. Carrascosa ◽  
E.L. Zapata
Keyword(s):  
3D Reconstruction ◽  
3D Structure ◽  
Three Dimensional ◽  
Software Tools ◽  
Mapping Method ◽  
Computer Architectures ◽  
Parallel Computer ◽  
Reconstruction Process ◽  
Computing Power ◽  
Order Of Magnitude

Obtaining the three-dimensional (3D) structure of negatively stained biological specimens at a resolution of, typically, 2 - 4 nm is becoming a relatively common practice in an increasing number of laboratories. A combination of new conceptual approaches, new software tools, and faster computers have made this situation possible. However, all these 3D reconstruction processes are quite computer intensive, and the middle term future is full of suggestions entailing an even greater need of computing power. Up to now all published 3D reconstructions in this field have been performed on conventional (sequential) computers, but it is a fact that new parallel computer architectures represent the potential of order-of-magnitude increases in computing power and should, therefore, be considered for their possible application in the most computing intensive tasks.We have studied both shared-memory-based computer architectures, like the BBN Butterfly, and local-memory-based architectures, mainly hypercubes implemented on transputers, where we have used the algorithmic mapping method proposed by Zapata el at. In this work we have developed the basic software tools needed to obtain a 3D reconstruction from non-crystalline specimens (“single particles”) using the so-called Random Conical Tilt Series Method. We start from a pair of images presenting the same field, first tilted (by ≃55°) and then untilted. It is then assumed that we can supply the system with the image of the particle we are looking for (ideally, a 2D average from a previous study) and with a matrix describing the geometrical relationships between the tilted and untilted fields (this step is now accomplished by interactively marking a few pairs of corresponding features in the two fields). From here on the 3D reconstruction process may be run automatically.

scholarly journals Optical Encryption Based on Computer Generated Holograms in Photopolymer

Polymers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1358
Author(s):  
Taihui Wu ◽  
Jianshe Ma ◽  
Chengchen Wang ◽  
Haibei Wang ◽  
Liangcai Cao ◽  
...  
Keyword(s):  
High Speed ◽  
Three Dimensional ◽  
Angular Spectrum ◽  
Quick Response ◽  
Response Code ◽  
Optical Encryption ◽  
Large Size ◽  
Quick Response Code ◽  
Computer Generated Holograms ◽  
Encryption Method

An optical encryption method based on computer generated holograms printing of photopolymer is presented. Fraunhofer diffraction is performed based on the Gerchberg-Saxton algorithm, and a hologram of the Advanced Encryption Standard encrypted Quick Response code is generated to record the ciphertext. The holograms of the key and the three-dimensional image are generated by the angular spectrum diffraction algorithm. The experimental results show that large-size encrypted Quick Response (QR) code and miniature keys can be printed in photopolymers, which has good application prospects in optical encryption. This method has the advantages of high-density storage, high speed, large fault tolerance, and anti-peeping.

Three-Dimensional Computerized Anthropometry of the Nose: Landmark Representation Compared to Surface Analysis

2007 ◽  
Vol 44 (3) ◽  
pp. 278-285 ◽  
Author(s):  
Virgilio F. Ferrario ◽  
Fabrizio Mian ◽  
Redento Peretta ◽  
Riccardo Rosati ◽  
Chiarella Sforza
Keyword(s):  
Three Dimensional ◽  
Digital Data ◽  
Limits Of Agreement ◽  
B Splines ◽  
Surface Areas ◽  
Using Data ◽  
Difference Volume ◽  
T Values ◽  
Plaster Models ◽  
Plaster Casts

Objective: To compare three-dimensional nasal measurements directly made on subjects to those made on plaster casts, and nasal dimensions obtained with a surface-based approach to values obtained with a landmark representation. Methods: Soft-tissue nasal landmarks were directly digitized on 20 healthy adults. Stone casts of their noses were digitized and mathematically reconstructed using nonuniform rational B-splines (NURBS) curves. Linear distances, angles, volumes and surface areas were computed using facial landmarks and NURBS-reconstructed models (surface-based approach). Results: Measurements on the stone casts were somewhat smaller than values obtained directly from subjects (differences between −0.05 and −1.58 mm). Dahlberg's statistic ranged between 0.73 and 1.47 mm. Significant (p < .05) t values were found for 4 of 15 measurements. The surface-based approach gave values 3.5 (volumes) and 2.1 (surface area) times larger than those computed with the landmark-based method. The two values were significantly related (volume, r = 0.881; surface, r = 0.924; p < .001), the resulting equations estimated actual values well (mean difference, volume −0.01 mm3, SD 1.47, area 0.05 cm2, SD 1.44); limits of agreement between −2.89 and 2.87 mm3 (volume); −2.88 and 2.78 cm2 (area). Conclusions: Considering the characteristics of the two methods, and for practical purposes, nasal distances and angles obtained on plaster models were comparable to digital data obtained directly from subjects. Surface areas and volumes were best obtained using a surface-based approach, but could be estimated using data provided by the landmark representation.

Key Technologies Research on Color Contour Map of 3D Injection Molding Simulation Results

2012 ◽  
Vol 217-219 ◽  
pp. 1998-2001
Author(s):  
Tie Geng ◽  
Qing Hai Ren ◽  
Wei Qing Tu ◽  
Dan Dan Liu
Keyword(s):  
Injection Molding ◽  
Color Image ◽  
Three Dimensional ◽  
Physical Field ◽  
Contour Map ◽  
Image Rendering ◽  
Color Range ◽  
Key Technologies ◽  
Injection Molding Simulation ◽  
Simulation Results

According to the color contour map of the 3D injection molding simulation results, the commonly used color contour map drawing algorithm was researched, and a three-dimensional color image rendering algorithm which based on the "physical field values and color range mapping" was given too. And the key technologies of the algorithm which was used to draw 3D color contour map were introduced in detail. In the end, an example was given.

Facial reconstruction project

1970 ◽  
Vol 80 (1) ◽  
Author(s):  
Federico Cesarani ◽  
Maria Cristina Martina ◽  
Valter Capussotto ◽  
Andrea Giuliano ◽  
Renato Grilletto ◽  
...  
Keyword(s):  
3D Model ◽  
Multidetector Ct ◽  
Three Dimensional ◽  
Facial Reconstruction ◽  
Digital Data ◽  
Egyptian Mummy ◽  
Ancient Egyptian ◽  
Synthetic Materials ◽  
Reconstruction Project

Facial reconstruction of mummies and corpses is important in anthropological, medical and forensic studies. The purpose of our study was to evaluate the role of three- Dimensional Multidetector CT examination for 3D facial reconstruction. We present a multidisciplinary work performed by radiologists, anthropologists and forensic police in reconstructing the possible physiognomy of an ancient Egyptian mummy. Three-Dimensional data were obtained from a well-preserved completely wrapped Egyptian mummy from the collection of the Egyptian Museum in Torino, Italy, dated from XXII or XXIII dynasty (945-715 BC). Data were used as a model for the rapid prototyping stereolithographic technique, a method which allows the creation of 3D model with digital data using synthetic materials such as resin or nylon.

scholarly journals An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Guodong Ye ◽  
Kaixin Jiao ◽  
Chen Pan ◽  
Xiaoling Huang
Keyword(s):  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Ecg Signal ◽  
Hash Algorithm ◽  
Plain Image ◽  
Secure Hash Algorithm ◽  
Low Sensitivity ◽  
Encryption Method

In this paper, an effective framework for chaotic encryption based on a three-dimensional logistic map is presented together with secure hash algorithm-3 (SHA-3) and electrocardiograph (ECG) signal. Following the analysis of the drawbacks, namely, fixed key and low sensitivity, of some current algorithms, this work tries to solve these two problems and includes two contributions: (1) removal of the phenomenon of summation invariance in a plain-image, for which SHA-3 is proposed to calculate the hash value for the plain-image, with the results being employed to influence the initial keys for chaotic map; (2) resolution of the problem of fixed key by using an ECG signal, that can be different for different subjects or different for same subject at different times. The Wolf algorithm is employed to produce all the control parameters and initial keys in the proposed encryption method. It is believed that combining with the classical architecture of permutation-diffusion, the summation invariance in the plain-image and shortcoming of a fixed key will be avoided in our algorithm. Furthermore, the experimental results and security analysis show that the proposed encryption algorithm can achieve confidentiality.

Sign in / Sign up

Export Citation Format

Share Document