Image encryption based on nonlinear encryption system and public-key cryptography

2015 ◽  
Vol 338 ◽  
pp. 64-72 ◽  
Author(s):  
Tieyu Zhao ◽  
Qiwen Ran ◽  
Yingying Chi
Keyword(s):  
Image Encryption ◽  
Public Key Cryptography ◽  
Public Key

scholarly journals Multiple-Image Encryption Mechanism Based on Ghost Imaging and Public Key Cryptography

2019 ◽  
Vol 11 (4) ◽  
pp. 1-14 ◽  
Author(s):  
Leihong Zhang ◽  
Xiao Yuan ◽  
Kaimin Wang ◽  
Dawei Zhang
Keyword(s):  
Image Encryption ◽  
Public Key Cryptography ◽  
Public Key ◽  
Ghost Imaging ◽  
Multiple Image

Implementation Color-Images Cryptography Using RSA Algorithm

2017 ◽  
Vol 7 (11) ◽  
pp. 181
Author(s):  
Ali Saleh Al Najjar
Keyword(s):  
Information Security ◽  
Image Encryption ◽  
Color Images ◽  
Public Key ◽  
Open Channels ◽  
Image Security ◽  
Rsa Algorithm ◽  
The Media ◽  
Encrypted Images ◽  
Difficult Issue

Absolute protection is a difficult issue to maintain the confidentiality of images through their transmission over open channels such as internet or networks and is a major concern in the media, so image Cryptography becomes an area of attraction and interest of research in the field of information security. The paper will offer proposed system that provides a special kinds of image Encryption image security, Cryptography using RSA algorithm for encrypted images by HEX function to extract HEX Code and using RSA public key algorithm, to generate cipher image text. This approach provides high security and it will be suitable for secured transmission of images over the networks or Internet.

Analisis dan Implementasi Protokol Otentikasi FIDO U2F

2017 ◽  
Vol 9 (1) ◽  
pp. 30-35
Author(s):  
Sunderi Pranata ◽  
Hargyo Tri Nugroho ◽  
Hirofumi Yamaki
Keyword(s):  
Public Key Cryptography ◽  
Authentication Protocol ◽  
Public Key ◽  
Next Generation ◽  
Index Terms ◽  
Mitm Attack

It is known that password itself is not enough for formidable authentication method since it has a lot of vulnerabilities. Multi factor authentication (MFA) is introduced for the next generation for good authentication to address that issue. MFA combines two or more of three principles of good security, “something you know”, “something you have”, and “something you are”. Most MFA mechanisms work as one time passwords (OTP). However, they can still be vulnerable to phishing and MiTM attack. On top of that, OTP can be hard to use as it requires user to input another password given by the device (SMS, token, authenticator). Implemented in small USB U2F device, FIDO U2F delivers easier yet stronger security on authentication process which implements public key cryptography, challenge-response protocol, and phishing and MitM protection.  Index Terms— Authentication protocol, FIDO U2F, Multi factor authentication, OTP

IMPLEMENTASI ALGORITMA SCHMIDT-SAMOA PADA ENKRIPSI DEKRIPSI EMAIL BERBASIS ANDROID

2013 ◽  
Vol 9 (1) ◽  
Author(s):  
Willy Ristanto ◽  
Willy Sudiarto Raharjo ◽  
Antonius Rachmat Chrismanto
Keyword(s):  
Public Key Cryptography ◽  
Text Messages ◽  
Public Key ◽  
Client Application ◽  
Performance Measurements ◽  
Encryption And Decryption ◽  
Number Variation

Cryptography is a technique for sending secret messages. This research builds an Android-based email client application which implement cryptography with Schmidt-Samoa algorithm, which is classified as a public key cryptography. The algorithm performs encryption and decryption based on exponential and modulus operation on text messages. The application use 512 and 1024 bit keys. Performance measurements is done using text messages with character number variation of 5 – 10.000 characters to obtain the time used for encryption and decryption process. As a result of this research, 99,074% data show that decryption process is faster than encryption process. In 512 bit keys, the system can perform encryption process in 520 - 18.256 miliseconds, and decryption process in 487 - 5.688 miliseconds. In 1024 bit keys, system can perform encryption process in 5626 – 52,142 miliseconds (7.388 times slower than 512 bit keys) and decryption process with time 5463 – 15,808 miliseconds or 8.290 times slower than 512 bit keys.

Sign in / Sign up

Export Citation Format

Share Document