Public Network Security by Bluffing the Intruders Through Encryption Over Encryption Using Public Key Cryptography Method

Author(s):  
Vishu Madaan ◽  
Dimple Sethi ◽  
Prateek Agrawal ◽  
Leena Jain ◽  
Ranjit Kaur
Author(s):  
Ioannis P. Chochliouros ◽  
Stergios S. Chochliouros ◽  
Anastasia S. Spiliopoulou ◽  
Evita Lampadari

The work investigates some “core” features of public key infrastructures (PKI), including fundamental technologies and infrastructures, within the context of recent market demands for increased network security applications. To this aim, we explain the basic features of public key cryptography, in parallel with a variety of other major PKI functional operations, all able to affect network development and growth. Then, we discuss some among the relevant basic and PKI-derived services, in order to comply with current needs and security requirements, thus supporting both usage and deployment of such infrastructures in competitive markets. In addition, we focus on several recent advances of information and communication convergence, and the effect those advances have on the notion of PKI, especially if considering future challenges. PKI have now become a central part of securing today’s networked world and it should be expected that it will continue to have a huge impact on businesses. Furthermore, we correlate the above activities to recent European regulatory initiatives and similar commonly applied policies, to promote the appliance of digital signatures in a fully converged and liberalized market environment.


Author(s):  
Lance Fortnow

This chapter analyzes how, in 1976, Whitfield Diffie and Martin Hellman suggested that one could use NP to hide one's own secrets. The field of cryptography, the study of secret messages, changed forever. Diffie and Hellman, building on earlier work of Roger Merkle, proposed a method to get around the problem of network security using what they called “public-key” cryptography. A computer would generate two keys, a public key and a private key. The computer would store the private key, never putting that key on the network. The public key would be sent over the network broadcast to everyone. Diffie and Hellman's idea was to develop a cryptosystem that used the public key for encrypting messages, turning the real message into a coded one. The public key would not be able to decrypt the message. Only the private key could decrypt the message.


2017 ◽  
Vol 9 (1) ◽  
pp. 30-35
Author(s):  
Sunderi Pranata ◽  
Hargyo Tri Nugroho ◽  
Hirofumi Yamaki

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


2012 ◽  
Vol 35 (9) ◽  
pp. 1881 ◽  
Author(s):  
Hui-Xian LI ◽  
Xu-Bao CHEN ◽  
Liao-Jun PANG ◽  
Yu-Min WANG

2013 ◽  
Vol 9 (1) ◽  
Author(s):  
Willy Ristanto ◽  
Willy Sudiarto Raharjo ◽  
Antonius Rachmat Chrismanto

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