scholarly journals Chebyshev chaotic map-based ID-based cryptographic model using subtree and fuzzy-entity data sharing for public key cryptography

2018 ◽  
Vol 1 (1) ◽  
pp. e12 ◽  
Author(s):  
Chandrashekhar Meshram ◽  
Mohammad S. Obaidat ◽  
Sarita G. Meshram
Keyword(s):  
Data Sharing ◽  
Chaotic Map ◽  
Public Key Cryptography ◽  
Public Key ◽  
Chebyshev Chaotic Map

Fractional two-dimensional discrete chaotic map and its applications to the information security with elliptic-curve public key cryptography

2017 ◽  
Vol 24 (20) ◽  
pp. 4797-4824 ◽  
Author(s):  
Zeyu Liu ◽  
Tiecheng Xia ◽  
Jinbo Wang
Keyword(s):  
Elliptic Curve ◽  
Color Image ◽  
Chaotic Map ◽  
Public Key Cryptography ◽  
Public Key ◽  
Phase Portraits ◽  
Largest Lyapunov Exponent ◽  
Two Dimensional ◽  
Function Combination ◽  
The Difference

A novel fractional two-dimensional triangle function combination discrete chaotic map is proposed by use of the discrete fractional calculus. The chaos behaviors are then discussed when the difference order is a fractional one. The bifurcation diagrams, the largest Lyapunov exponent and the phase portraits are displayed, especially, the elliptic curve public key cryptosystem is used in color image encryption algorithm.

scholarly journals Broadcast Proxy Reencryption Based on Certificateless Public Key Cryptography for Secure Data Sharing

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Won-Bin Kim ◽  
Su-Hyun Kim ◽  
Daehee Seo ◽  
Im-Yeong Lee
Keyword(s):  
Data Sharing ◽  
Computational Efficiency ◽  
Computation Time ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Public Key ◽  
Broadcast Encryption ◽  
Key Escrow ◽  
Certificateless Public Key Cryptography ◽  
Verification Problem

Broadcast proxy reencryption (BPRE), which combines broadcast encryption (BE) and proxy reencryption (PRE), is a technology used for the redistribution of data uploaded on the cloud to multiple users. BPRE reencrypts data encrypted by the distributor and then uploads it to the cloud into a ciphertext that at a later stage targets multiple recipients. As a result of this, flexible data sharing is possible for multiple recipients. However, various inefficiencies and vulnerabilities of the BE, such as the recipient anonymity problem and the key escrow problem, also creep into BPRE. Our aim in this study was to address this problem of the existing BPRE technology. The partial key verification problem that appeared in the process of solving the key escrow problem was solved, and the computational efficiency was improved by not using bilinear pairing, which requires a lot of computation time.

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