scholarly journals Efficient implementation for QUAD stream cipher with GPUs

2013 ◽  
Vol 10 (2) ◽  
pp. 897-911 ◽  
Author(s):  
Satoshi Tanaka ◽  
Takashi Nishide ◽  
Kouichi Sakurai
Keyword(s):  
Provable Security ◽  
Stream Cipher ◽  
Computational Cost ◽  
Polynomial Systems ◽  
Efficient Implementation ◽  
Multivariate Polynomial ◽  
Multivariate Cryptography ◽  
Parallel Arithmetic ◽  
Np Complete ◽  
Multivariate Systems

QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.

scholarly journals Accelerated Solution of Multivariate Polynomial Systems of Equations

2003 ◽  
Vol 32 (2) ◽  
pp. 435-454 ◽  
Author(s):  
B. Mourrain ◽  
V. Y. Pan ◽  
O. Ruatta
Keyword(s):  
Polynomial Systems ◽  
Systems Of Equations ◽  
Multivariate Polynomial

The Problem of Scheduling Parallel Computations of Multibody Dynamic Analysis Is NP-Hard

1996 ◽  
Author(s):  
Jin-Fan Liu ◽  
Karim A. Abdel-Malek
Keyword(s):  
Dynamic Analysis ◽  
Spanning Tree ◽  
Minimum Weight ◽  
Computational Cost ◽  
Parallel Computations ◽  
Np Hard ◽  
Multibody Dynamic ◽  
Np Hard Problem ◽  
Np Complete ◽  
Minimum Weight Spanning Tree

Abstract A formulation of a graph problem for scheduling parallel computations of multibody dynamic analysis is presented. The complexity of scheduling parallel computations for a multibody dynamic analysis is studied. The problem of finding a shortest critical branch spanning tree is described and transformed to a minimum radius spanning tree, which is solved by an algorithm of polynomial complexity. The problems of shortest critical branch minimum weight spanning tree (SCBMWST) and the minimum weight shortest critical branch spanning tree (MWSCBST) are also presented. Both problems are shown to be NP-hard by proving that the bounded critical branch bounded weight spanning tree (BCBBWST) problem is NP-complete. It is also shown that the minimum computational cost spanning tree (MCCST) is at least as hard as SCBMWST or MWSCBST problems, hence itself an NP-hard problem. A heuristic approach to solving these problems is developed and implemented, and simulation results are discussed.

A Method for Efficient Implementation of a Radial-Based Noise Power Estimator for Weather Radars

2021 ◽  
Author(s):  
Martin Hurtado
Keyword(s):  
Closed Form ◽  
Background Noise ◽  
Computational Cost ◽  
Weather Radar ◽  
Efficient Implementation ◽  
Noise Power ◽  
Free Range ◽  
Weather Radars ◽  
Low Computational Cost

AbstractIn a previous work, a weather radar algorithm with low computational cost has been developed to estimate the background noise power from the data collected at each radial. The algorithm consists of a sequence of steps designed to identify signal-free range volumes which are subsequently used to estimate the noise power. In this paper, we derive compact-closed form expressions to replace the numerical formulations used in the first two steps of the algorithm proposed in the original paper. The goal is to facilitate efficient implementation of the algorithm.

Design and efficient implementation of a chaos-based stream cipher

2017 ◽  
Vol 7 (2) ◽  
pp. 89 ◽  
Author(s):  
Mohammed Abu Taha ◽  
Safwan El Assad ◽  
Audrey Queudet ◽  
Olivier Deforges
Keyword(s):  
Stream Cipher ◽  
Efficient Implementation

Design and efficient implementation of a chaos-based stream cipher

2017 ◽  
Vol 7 (2) ◽  
pp. 89
Author(s):  
Olivier Deforges ◽  
Audrey Queudet ◽  
Safwan El Assad ◽  
Mohammed Abu Taha
Keyword(s):  
Stream Cipher ◽  
Efficient Implementation

Numerical solution of multivariate polynomial systems by homotopy continuation methods

Acta Numerica ◽  
1997 ◽  
Vol 6 ◽  
pp. 399-436 ◽  
Author(s):  
T. Y. Li
Keyword(s):  
Power Flow ◽  
Polynomial Systems ◽  
Continuation Methods ◽  
Homotopy Continuation ◽  
Multivariate Polynomial ◽  
Science And Engineering ◽  
Flow Problems ◽  
Homotopy Continuation Methods ◽  
Buchberger Algorithm ◽  
Image Position

Let P(x) = 0 be a system of n polynomial equations in n unknowns. Denoting P = (p1,…, pn), we want to find all isolated solutions offor x = (x1,…,xn). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Gröbner bases, are the classical approach to solving (1.1), but their reliance on symbolic manipulation makes those methods seem somewhat unsuitable for all but small problems.

A FRACTIONAL DELAY FIR FILTER BASED ON LAGRANGE INTERPOLATION OF FARROW STRUCTURE

2013 ◽  
pp. 107-111
Author(s):  
K. RAJALAKSHMI ◽  
SWATHI GONDI ◽  
A. KANDASWAMY
Keyword(s):  
Lagrange Interpolation ◽  
Polynomial Interpolation ◽  
Sampling Rate ◽  
Computational Cost ◽  
Efficient Implementation ◽  
Time Varying ◽  
Farrow Structure ◽  
Fractional Delay ◽  
Conventional Structure ◽  
Implementation Technique

An efficient implementation technique for the Lagrange interpolation is derived. This formulation called the Farrow structure leads to a version of Lagrange interpolation that is well suited to time varying FD filtering. Lagrange interpolation is mostly used for fractional delay approximation as it can be used for increasing the sampling rate of signals and systems. Lagrange interpolation is one of the representatives for a class of polynomial interpolation techniques. The computational cost of this structure is reduced as the number of multiplications are minimised in the new structure when compared with the conventional structure.

Sign in / Sign up

Export Citation Format

Share Document