scholarly journals Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

2020 ◽  
Vol 15 ◽  
Keyword(s):  
Network Security ◽  
Public Key ◽  
Quantum Network ◽  
Goppa Codes ◽  
Strength Performance ◽  
The Public ◽  
Encryption Schemes ◽  
Post Quantum Cryptography ◽  
The Given ◽  
Theoretical Foundations

The paper is aimed at analyzing of the classical McEliece and Niederreiter cryptosystems as well as theQuasi-Cyclic MDPC McEliece cipher in a context of the post-quantum network security. Theoretical foundations ofthe aforesaid cryptographic schemes are considered. The characteristics of the given cryptosystems and otherasymmetric encryption schemes are analyzed. The cipher metrics, which are considered in the paper, includecryptographic strength, performance, public key size and length of ciphertext. The binary Goppa codes are describedin the context of their role for the cryptanalytic resistance of the classic McEliece and Niederreiter schemes. Thecrucial advantages and drawbacks of the aforementioned cryptosystems are analyzed. The prospects for applicationof these ciphers to the network security protocols are outlined. The investigations, which are aimed at finding waysto reduce the public key sizes and improve the energy efficiency of the given ciphers, are briefly described. A neweducational module “Introduction to Post-Quantum Cryptography” is presented

scholarly journals Key Distribution for Post Quantum Cryptography using Physical Unclonable Functions

2021 ◽  
Author(s):  
Bertrand Cambou ◽  
Michael Gowanlock ◽  
Bahattin Yildiz ◽  
Dina Ghanaimiandoab ◽  
Kaitlyn Lee ◽  
...  
Keyword(s):  
High Performance ◽  
Public Key ◽  
Graphic Processing Units ◽  
Public And Private ◽  
Physical Unclonable Functions ◽  
The Public ◽  
Cryptographic Keys ◽  
Post Quantum Cryptography ◽  
Network Technologies ◽  
And Storage

Lattice and code cryptography can replace existing schemes such as Elliptic Curve Cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic keys is then more complex to handle longer keys. This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code based cryptography. Handshakes between client devices containing the PUFs and a server are used to select sets of addressable positions in the PUFs, from which streams of bits called seeds are generated on demand. The public and private cryptographic key pairs are computed from these seeds together with additional streams of random numbers. The method allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network. Technologies such as High performance computing, and graphic processing units can further enhance security by preventing attackers to make this independent validation when only equipped with less powerful computers.

Secrets

2017 ◽  
Author(s):  
Lance Fortnow
Keyword(s):  
Network Security ◽  
Public Key Cryptography ◽  
Public Key ◽  
The Real ◽  
The Public ◽  
Private Key

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.

scholarly journals STUDY ON IMPROVEMENT IN RSA ALGORITHM AND ITS IMPLEMENTATION

2016 ◽  
pp. 190-195
Author(s):  
P. SAVEETHA ◽  
S. ARUMUGAM
Keyword(s):  
Network Security ◽  
Internet Security ◽  
Public Key ◽  
Research Papers ◽  
The Public ◽  
Rsa Algorithm ◽  
Cryptographic Algorithm ◽  
The World ◽  
Cryptographic Algorithms ◽  
Interconnected Networks

The Network Security means to protect data during their transmission over channel of networks similarly Internet Security also to protect data during their transmission over a collection of interconnected networks in all over the world. Cryptography is the way of hiding information during transmission over a cannel. There are lots of cryptographic algorithms available to protect our data from intruders.RSA also one of effective the public key cryptographic algorithm which needs time and memory. Many research papers submitted on this cryptographic algorithm. Each paper has different perspective.

scholarly journals Recent Developments in Multivariate Public Key Cryptosystems

2020 ◽  
pp. 209-229
Author(s):  
Yasufumi Hashimoto
Keyword(s):  
Quantum Cryptography ◽  
The Other ◽  
Public Key ◽  
Signature Schemes ◽  
Public Key Cryptosystems ◽  
Suitable Parameter ◽  
Encryption Schemes ◽  
Recent Developments ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key

Abstract The multivariate signature schemes UOV, Rainbow, and HFEv- have been considered to be secure and efficient enough under suitable parameter selections. In fact, several second round candidates of NIST’s standardization project of Post-Quantum Cryptography are based on these schemes. On the other hand, there are few multivariate encryption schemes expected to be practical and despite that, various new schemes have been proposed recently. In the present paper, we summarize multivariate schemes UOV, Rainbow, and (variants of) HFE generating the second round candidates and study the practicalities of several multivariate encryption schemes proposed recently.

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

scholarly journals Intellectual Freedom and Social Justice: Tensions Between Core Values in American Librarianship

2020 ◽  
Vol 4 (1) ◽  
pp. 1-10
Author(s):  
Emily J. M. Knox
Keyword(s):  
Social Justice ◽  
Core Values ◽  
Intellectual Freedom ◽  
Bill Of Rights ◽  
Hate Groups ◽  
Ethical Philosophy ◽  
The Public ◽  
The Past ◽  
The Public Sphere ◽  
Theoretical Foundations

AbstractOver the past few years, tensions between two core values in U.S. librarianship, intellectual freedom and social justice, have roiled the profession. This conflict was most recently seen in the insertion and subsequent removal of “hate groups” to the list of entities that cannot be denied access to library meeting rooms in the American Library Association’s Meeting Rooms Interpretation of the Library Bill of Rights. This paper is intended to provide context for this conflict. It begins by situating its arguments within ethical philosophy, specifically the study of values or axiology. It then provides an overview of the theoretical foundations of the values of liberalism. Next, the paper discusses the values of truth and freedom from harm in librarianship. Finally, it suggests that a fuller understanding of the library’s place within the public sphere is a possible model for mitigating the tensions currently found in American librarianship. The paper is intended to provide a theoretical foundation for further research.

scholarly journals BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
The Other ◽  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
The Public ◽  
Private Key ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Encryption Decryption ◽  
Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

Sign in / Sign up

Export Citation Format

Share Document