scholarly journals Using Simon's algorithm to attack symmetric-key cryptographic primitives

2017 ◽  
Vol 17 (1&2) ◽  
pp. 65-78
Author(s):  
Thomas Santoli ◽  
Christian Schaffner
Keyword(s):  
Quantum Information ◽  
Cryptographic Primitives ◽  
Forgery Attack ◽  
Security Proofs ◽  
Symmetric Key ◽  
Quantum Oracle ◽  
Independent Work ◽  
Oracle Access

We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon’s algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a chosen-prefix message querying only other messages (of the same length). We assume that an adversary has quantum-oracle access to the respective classical primitives. Similar results have been achieved recently in independent work by Kaplan et al. [KLLNP16]. Our findings shed new light on the post-quantum security of cryptographic schemes and underline that classical security proofs of cryptographic constructions need to be revisited in light of quantum attackers.

Proposal for dimensionality testing in QPQ

2018 ◽  
Vol 18 (13&14) ◽  
pp. 1125-1142
Author(s):  
Arpita Maitra ◽  
Bibhas Adhikari ◽  
Satyabrata Adhikari
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Quantum System ◽  
Quantum State ◽  
Quantum Information Processing ◽  
Quantum States ◽  
Quantum Private Query ◽  
Unfair Advantage ◽  
Security Proofs

Recently, dimensionality testing of a quantum state has received extensive attention (Ac{\'i}n et al. Phys. Rev. Letts. 2006, Scarani et al. Phys. Rev. Letts. 2006). Security proofs of existing quantum information processing protocols rely on the assumption about the dimension of quantum states in which logical bits are encoded. However, removing such assumption may cause security loophole. In the present paper, we show that this is indeed the case. We choose two players' quantum private query protocol by Yang et al. (Quant. Inf. Process. 2014) as an example and show how one player can gain an unfair advantage by changing the dimension of subsystem of a shared quantum system. To resist such attack we propose dimensionality testing in a different way. Our proposal is based on CHSH like game. As we exploit CHSH like game, it can be used to test if the states are product states for which the protocol becomes completely vulnerable.

scholarly journals Towards the Construction of Reed-Muller Code Based Symmetric Key FHE

2021 ◽  
Vol 26 (6) ◽  
pp. 585-590
Author(s):  
Ratnakumari Challa ◽  
VijayaKumari Gunta
Keyword(s):  
Structural Properties ◽  
Experimental Evaluation ◽  
Coding Theory ◽  
Homomorphic Encryption ◽  
Cryptographic Primitives ◽  
Correctness Proof ◽  
Security Applications ◽  
Unlimited Number ◽  
Multiplication Operation ◽  
Symmetric Key

Homomorphic encryption (HE) schemes became popular cryptographic primitives and very useful in variety of security applications. Homomorphic encryption based on coding theory have the advantages of faster computations due to the structural properties of the codes used. Several schemes are supporting unlimited Mod2 addition operations in literature. The present paper introduces Reed-Muller (RM) code based Mod2 multiplication operation thereby making RM code based HE scheme fully homomorphic. The representation of the codeword with necessary adaption to support unlimited number of Mod2​ multiplication operations is presented along with the scheme first. The correctness proof of the homomorphic operations along with experimental evaluation is also presented to demonstrate the practical aspects of the proposal.

Exploring Differential-Based Distinguishers and Forgeries for ASCON

2021 ◽  
pp. 102-136
Author(s):  
David Gerault ◽  
Thomas Peyrin ◽  
Quan Quan Tan
Keyword(s):  
Black Box ◽  
Authenticated Encryption ◽  
Cryptographic Primitives ◽  
Search Heuristics ◽  
First Choice ◽  
Differential Characteristic ◽  
Symmetric Key ◽  
Performance Profiles ◽  
Automated Methods ◽  
Recent Attack

Automated methods have become crucial components when searching for distinguishers against symmetric-key cryptographic primitives. While MILP and SAT solvers are among the most popular tools to model ciphers and perform cryptanalysis, other methods with different performance profiles are appearing. In this article, we explore the use of Constraint Programming (CP) for differential cryptanalysis on the Ascon authenticated encryption family (first choice of the CAESAR lightweight applications portfolio and current finalist of the NIST LWC competition) and its internal permutation. We first present a search methodology for finding differential characteristics for Ascon with CP, which can easily find the best differential characteristics already reported by the Ascon designers. This shows the capability of CP in generating easily good differential results compared to dedicated search heuristics. Based on our tool, we also parametrize the search strategies in CP to generate other differential characteristics with the goal of forming limited-birthday distinguishers for 4, 5, 6 and 7 rounds and rectangle attacks for 4 and 5 rounds of the Ascon internal permutation. We propose a categorization of the distinguishers into black-box and non-black-box to better differentiate them as they are often useful in different contexts. We also obtained limited-birthday distinguishers which represent currently the best known distinguishers for 4, 5 and 6 rounds under the category of non-black-box distinguishers. Leveraging again our tool, we have generated forgery attacks against both reduced-rounds Ascon-128 and Ascon-128a, improving over the best reported results at the time of writing. Finally, using the best differential characteristic we have found for 2 rounds, we could also improve a recent attack on round-reduced Ascon-Hash.

Simple quantum information algorithms in cavity QED

2003 ◽  
Vol 50 (6-7) ◽  
pp. 901-913 ◽  
Author(s):  
H. Ollivier ◽  
F. Yamaguchi ◽  
M. Brune ◽  
J. M. Raimond ◽  
S. Haroche ◽  
...  
Keyword(s):  
Quantum Information ◽  
Cavity Qed ◽  
Simple Quantum

Self-and-match system suppresses vocal stereotypy during independent work.

2017 ◽  
Vol 17 (3) ◽  
pp. 274-285
Author(s):  
Andrew J. Bulla ◽  
Jessica E. Frieder
Keyword(s):  
Vocal Stereotypy ◽  
Independent Work

MANAGEMENT OF THE SUCCESS OF STUDENT’S LEARNING BASED ON THE MARKOV MODEL

2018 ◽  
pp. 4-11
Author(s):  
M. V. Noskov ◽  
M. V. Somova ◽  
I. M. Fedotova
Keyword(s):  
Information System ◽  
Markov Process ◽  
Continuous Time ◽  
Information Technologies ◽  
Educational Process ◽  
Automated Information System ◽  
The Subject ◽  
The University ◽  
Independent Work ◽  
Near Future

The article proposes a model for forecasting the success of student’s learning. The model is a Markov process with continuous time, such as the process of “death and reproduction”. As the parameters of the process, the intensities of the processes of obtaining and assimilating information are offered, and the intensity of the process of assimilating information takes into account the attitude of the student to the subject being studied. As a result of applying the model, it is possible for each student to determine the probability of a given formation of ownership of the material being studied in the near future. Thus, in the presence of an automated information system of the university, the implementation of the model is an element of the decision support system by all participants in the educational process. The examples given in the article are the results of an experiment conducted at the Institute of Space and Information Technologies of Siberian Federal University under conditions of blended learning, that is, under conditions when classroom work is accompanied by independent work with electronic resources.

Non-standard methods for converting numbers from one number system to another

2020 ◽  
Vol 1 (9) ◽  
pp. 28-30
Author(s):  
D. M. Zlatopolski
Keyword(s):  
Binary System ◽  
Maximum Degree ◽  
Number System ◽  
Binary Form ◽  
Binary Number ◽  
Standard Methods ◽  
Optimal Variant ◽  
Decimal System ◽  
Large Numbers ◽  
Independent Work

The article describes a number of little-known methods for translating natural numbers from one number system to another. The first is a method for converting large numbers from the decimal system to the binary system, based on multiple divisions of a given number and all intermediate quotients by 64 (or another number equal to 2n ), followed by writing the last quotient and the resulting remainders in binary form. Then two methods of mutual translation of decimal and binary numbers are described, based on the so-called «Horner scheme». An optimal variant of converting numbers into the binary number system by the method of division by 2 is also given. In conclusion, a fragment of a manuscript from the beginning of the late 16th — early 17th centuries is published with translation into the binary system by the method of highlighting the maximum degree of number 2. Assignments for independent work of students are offered.

Sign in / Sign up

Export Citation Format

Share Document