scholarly journals Ping-Pong Protocols as Prefix Grammars and Turchin Relation

10.29007/lw7c ◽  
2018 ◽  
Author(s):  
Antonina Nepeivoda
Keyword(s):  
Word Problem ◽  
Cryptographic Protocols ◽  
General Purpose ◽  
Empty Word ◽  
Transformation Technique ◽  
Ping Pong

The paper describes how to verify cryptographic protocols by a general-purpose programtransformation technique with unfolding. The questions of representation and analysisof the protocols as prefix rewriting grammars are discussed. In these aspects Higman andTurchin embeddings on computational paths are considered, and a refinement of Turchin’srelation is presented that allows to algorithmically decide the empty word problem forprefix rewriting grammars.

A Simple Low-Inertia Anemometer of the Three Cup Type

1955 ◽  
Vol 36 (8) ◽  
pp. 384-389 ◽  
Author(s):  
A. Richard Kassander ◽  
Robert M. Stewart
Keyword(s):  
General Purpose ◽  
Research Tool ◽  
Rapid Response ◽  
Ping Pong ◽  
Cup Wheel ◽  
Starting Speed

This report describes the development, testing, and use of a three-cup type anemometer, the cup-wheel assembly of which is constructed of “ping-pong” balls. The anemometer has certain superior qualities with respect to ease of construction, ease of recording, low starting speed, and rapid response. With certain simple modifications it should be considered as a general purpose micrometeorological research tool.

scholarly journals Recursion vs. Replication in Simple Cryptographic Protocols

2004 ◽  
Vol 11 (23) ◽  
Author(s):  
Hans Hüttel ◽  
Jirí Srba
Keyword(s):  
Process Algebra ◽  
Cryptographic Protocols ◽  
Reachability Analysis ◽  
Equivalence Checking ◽  
Ping Pong ◽  
Nondeterministic Choice ◽  
Analysis And Synthesis ◽  
Full Analysis

We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is capable of an implicit description of the active intruder, including full analysis and synthesis of messages in the sense of Amadio, Lugiez and Vanackere. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable.

scholarly journals New Commitment Schemes Based on Conjugacy Problems over Rubik’s Groups

Information ◽  
2021 ◽  
Vol 12 (8) ◽  
pp. 294
Author(s):  
Ping Pan ◽  
Junzhi Ye ◽  
Yun Pan ◽  
Lize Gu ◽  
Licheng Wang
Keyword(s):  
Word Problem ◽  
Building Blocks ◽  
Cryptographic Protocols ◽  
Encryption Algorithm ◽  
Search Problem ◽  
Symmetric Encryption ◽  
Commitment Schemes ◽  
Conjugacy Search Problem ◽  
Conjugacy Search

Commitment schemes are important tools in cryptography and used as building blocks in many cryptographic protocols. We propose two commitment schemes by using Rubik’s groups. Our proposals do not lay the security on the taken-for-granted hardness of the word problem over Rubik’s groups. Instead, our first proposal is based on a symmetric encryption algorithm that is secure based on the hardness of the conjugacy search problem over Rubik’s groups, while our second proposal is based on the hardness of a newly derived problem—the functional towering conjugacy search problem over Rubik’s groups. The former is proved secure in the sense of both computational hiding and binding, while the latter is proved even secure in the sense of perfect hiding and computational binding. Furthermore, the proposed schemes have a remarkable performance advantage: a linear commitment/opening speed. We also evaluate the efficiency of the commitment schemes and show that they are considerably fast.

scholarly journals Guiding a general-purpose C verifier to prove cryptographic protocols

2014 ◽  
Vol 22 (5) ◽  
pp. 823-866 ◽  
Author(s):  
François Dupressoir ◽  
Andrew D. Gordon ◽  
Jan Jürjens ◽  
David A. Naumann
Keyword(s):  
Cryptographic Protocols ◽  
General Purpose

scholarly journals Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols

2011 ◽  
Author(s):  
Francois Dupressoir ◽  
Andrew D. Gordon ◽  
Jan Jurjens ◽  
David A. Naumann
Keyword(s):  
Cryptographic Protocols ◽  
General Purpose

scholarly journals FPGA Based High Speed SPA Resistant Elliptic Curve Scalar Multiplier Architecture

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Khalid Javeed ◽  
Xiaojun Wang
Keyword(s):  
Elliptic Curve ◽  
High Speed ◽  
Cryptographic Protocols ◽  
General Purpose ◽  
Good Choice ◽  
Scalar Multiplication ◽  
Computational Time ◽  
Multiplication Operation ◽  
Hardware Architectures ◽  
Elliptic Curve Scalar Multiplication

The higher computational complexity of an elliptic curve scalar point multiplication operation limits its implementation on general purpose processors. Dedicated hardware architectures are essential to reduce the computational time, which results in a substantial increase in the performance of associated cryptographic protocols. This paper presents a unified architecture to compute modular addition, subtraction, and multiplication operations over a finite field of large prime characteristicGF(p). Subsequently, dual instances of the unified architecture are utilized in the design of high speed elliptic curve scalar multiplier architecture. The proposed architecture is synthesized and implemented on several different Xilinx FPGA platforms for different field sizes. The proposed design computes a 192-bit elliptic curve scalar multiplication in 2.3 ms on Virtex-4 FPGA platform. It is 34%faster and requires 40%fewer clock cycles for elliptic curve scalar multiplication and consumes considerable fewer FPGA slices as compared to the other existing designs. The proposed design is also resistant to the timing and simple power analysis (SPA) attacks; therefore it is a good choice in the construction of fast and secure elliptic curve based cryptographic protocols.

Sign in / Sign up

Export Citation Format

Share Document