scholarly journals Processes and methods for selecting system-wide parameters and analysis of resistance against third-party channel attacks for the key encapsulation mechanism DSTU 8961:2019

Radiotekhnika ◽  
2021 ◽  
pp. 71-78
Author(s):  
V.A. Kulibaba
Keyword(s):  
Third Party ◽  
Public Key ◽  
Quantum Computers ◽  
Main Task ◽  
Mathematical Methods ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Key Encapsulation Mechanism ◽  
Near Future ◽  
Selection Of

In recent years, there has been significant progress in the creation of quantum computers. If scalable quantum computers are implemented in the near future, this will jeopardize the security of the most widely used public key cryptosystems. The most vulnerable are public-key schemes based on factorization, discrete logarithms and elliptic curve cryptography. Currently, the main task is to develop, evaluate, study and standardize asymmetric crypto transformations at the international level, including mechanisms of key encapsulation and directional encryption, resistant to attacks by violators of the post-quantum period. An important feature of the transition and post-quantum period is the usage of new mathematical methods to opposite quantum crypto analysis. The paper considers the main attacks on the mechanisms of key encapsulation and directional encryption, as well as system-wide parameters of the DSTU 8961: 2019 standard, which affect the resistance to attacks and the complexity of transformations. Methods for generating system-wide parameters of 5 and 7 levels of stability – 512 bits of classical and 256 bits of quantum security, as well as the protection of the algorithm from attacks by third-party channels are considered. The dependence of encryption and decryption time on the level of stability is analyzed. The results of calculations of system-wide parameters for stability levels 256/128, 384/192 and 512/256 are presented, as well as recommendations for the selection of system-wide parameters depending on the environment and computing capabilities. Sets of parameters selected and recommended for use in the DSTU 8961: 2019 standard are given. Conclusions are drawn about the possibility of applying the DSTU 8961 standard in the post-quantum period.

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.

Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm

2018 ◽  
pp. 563-588
Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj
Keyword(s):  
Quantum Computing ◽  
Secure Communication ◽  
Prime Numbers ◽  
Cryptographic Protocols ◽  
Public Key ◽  
Quantum Computers ◽  
New Paradigm ◽  
Public Key Cryptosystems ◽  
Computing Paradigm ◽  
Diffie Hellman

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.

Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm

2016 ◽  
pp. 664-688
Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj
Keyword(s):  
Quantum Computing ◽  
Secure Communication ◽  
Prime Numbers ◽  
Cryptographic Protocols ◽  
Public Key ◽  
Quantum Computers ◽  
New Paradigm ◽  
Public Key Cryptosystems ◽  
Computing Paradigm ◽  
Diffie Hellman

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.

Key Authentication Scheme-based on Discrete Logarithms and Chinese Remainder Theorem

2016 ◽  
Vol 66 (6) ◽  
pp. 590
Author(s):  
P. Kumaraswamy ◽  
C.V. Guru Rao ◽  
V. Janaki ◽  
K.V.T.K.N. Prashanth
Keyword(s):  
Chinese Remainder Theorem ◽  
Authentication Scheme ◽  
Third Party ◽  
Public Key ◽  
Online Services ◽  
Trusted Third Party ◽  
Discrete Logarithms ◽  
The Public ◽  
Public Key Cryptosystems

<p>Public key cryptosystems are secure only when the authenticity of the public key is assured. Shao proposed<br />a new scheme to overcome the problems of the existing schemes, which suffers from two major drawbacks. The<br />first drawback is the availability of users’ passwords in plaintext format in key server which are prone to attacks<br />by ill-minded users. The second one is depending on the key server blindly for certificate generation, without<br />further verification by the user. To overcome these severe drawbacks, we proposed an improved key authentication<br />scheme based on Chinese remainder theorem and discrete logarithms. Our scheme allows the user to generate his/<br />her certificate without the help of any trusted third party. This scheme is intended for online services, military and<br />defense applications to exchange keys securely.<br /> </p>

RSA-Public Key Cryptosystems Based on Quadratic Equations in Finite Field

2014 ◽  
pp. 238-258
Author(s):  
Sattar B. Sadkhan Al Maliky ◽  
Luay H. Al-Siwidi
Keyword(s):  
Finite Field ◽  
Chinese Remainder Theorem ◽  
Quadratic Equation ◽  
Public Key ◽  
Factorization Problem ◽  
Quadratic Equations ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Mathematical Problems ◽  
One Way Function

The importance of Public Key Cryptosystems (PKCs) in the cryptography field is well known. They represent a great revolution in this field. The PKCs depend mainly on mathematical problems, like factorization problem, and a trapdoor one-way function problem. Rivest, Shamir, and Adleman (RSA) PKC systems are based on factorization mathematical problems. There are many types of RSA cryptosystems. Rabin's Cryptosystem is considered one example of this type, which is based on using the square order (quadratic equation) in encryption function. Many cryptosystems (since 1978) were implemented under such a mathematical approach. This chapter provides an illustration of the variants of RSA-Public Key Cryptosystems based on quadratic equations in Finite Field, describing their key generation, encryption, and decryption processes. In addition, the chapter illustrates a proposed general formula for the equation describing these different types and a proposed generalization for the Chinese Remainder Theorem.

Quantum McEliece public-key cryptosystem

2012 ◽  
Vol 12 (3&4) ◽  
pp. 181-203
Author(s):  
Hachiro Fujita
Keyword(s):  
Coding Theory ◽  
Explicit Construction ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Key Generation ◽  
Public Key Cryptosystems ◽  
Algebraic Coding Theory ◽  
Mceliece Cryptosystem ◽  
Alternative Systems ◽  
Encryption And Decryption

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the classical McEliece cryptosystem. We present an explicit construction of the quantum McEliece public-key cryptosystem using Calderbank-Shor-Steane codes based on generalized Reed-Solomon codes. We examine the security of our quantum McEliece cryptosystem and compare it with alternative systems.

scholarly journals Overview of the Mceliece Cryptosystem and its Security

2014 ◽  
Vol 60 (1) ◽  
pp. 57-83 ◽  
Author(s):  
Marek Repka ◽  
Pavol Zajac
Keyword(s):  
Public Key ◽  
Goppa Codes ◽  
Implementation Challenges ◽  
Low Resource ◽  
Public Key Cryptosystems ◽  
Mceliece Cryptosystem ◽  
Side Channels ◽  
Current State ◽  
Selection Of

Abstract McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details of MECS based on irreducible binary Goppa codes, and review some of the implementation challenges for this system. Furthermore, we survey various proposals that use alternative codes for MECS, and point out some attacks on modified systems. Finally, we review notable existing implementations on low-resource platforms, and conclude with the topic of side channels in the implementations of MECS

SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN GURU BERPRESTASI KOTA MEDAN MENERAPKAN METODE PREFERENCES SELECTION INDEX (STUDI KASUS : DINAS PENDIDIKAN KOTA MEDAN)

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Fajar Syahputra ◽  
Mesran Mesran ◽  
Ikhwan Lubis ◽  
Agus Perdana Windarto
Keyword(s):  
Decision Making ◽  
Decision Support ◽  
Decision Support System ◽  
Support System ◽  
Formal Education ◽  
Basic Education ◽  
Selection Index ◽  
Main Task ◽  
Selection Of

The teacher is a major milestone in the world of education, the ability and achievement of students cannot be separated from the role of a teacher in teaching and guiding students. Based on the Law of the Republic of Indonesia No. 14 of 2005 concerning Teachers and Lecturers, in Article 1 explained that teachers are professional educators with the main task of educating, teaching, guiding, directing, training, evaluating, and evaluating students in early childhood education through formal education, basic education and education medium. Whereas in Article 4 of the Act, it is explained that the position of teachers as professionals serves to enhance the dignity and role of teachers as learning agents to function to improve the quality of national education.Decision making is an election process, among various alternatives that aim to meet one or several targets. The decision-making system has 4 phases, namely intelligence, design, choice and implementation. These phases are the basis for decision making, which ends with a recommendation.The Preferences Selection Index (PSI) method is a rarely used decision support system method. This method is a method developed by stevanie and Bhatt (2010) to solve the Multi Criteria Decision Making (MCDM). With the right consideration, this method can be one of the tools to determine policies in decision-making systems, especially the selection of outstanding teachers. Determination of policies taken as a basis for decision making, must use criteria that can be defined clearly and objectively.Keywords: Decision Support System, PSI, Selection of Achieving Teachers

Sign in / Sign up

Export Citation Format

Share Document