Results 21 to 30 of about 985 (69)

The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]

, 2017
In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.Comment: 8 ...
Gadiyar, H. Gopalakrishna, Padma, R.
core   +3 more sources

On the Classical-Quantum Relation of Constants of Motion

Frontiers in Physics, 2018
Groenewold-Van Hove theorem suggest that is not always possible to transform classical observables into quantum observables (a process known as quantization) in a way that, for all Hamiltonians, the constants of motion are preserved.
Fabian Belmonte, Tomas Veloz, Tomas Veloz, Tomas Veloz   +3 more
doaj   +1 more source

A Study on Splay Trees

, 2020
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence.
Russo, Luís M. S.
core   +1 more source

Algorithmic Aspects of Some Variants of Domination in Graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj   +1 more source

No-Free-Lunch Theorems in the continuum [PDF]

, 2014
No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions.
Alabert, Aureli, Berti, Alessandro, Caballero, Ricard, Ferrante, Marco   +3 more
core   +1 more source

Expansion complexity and linear complexity of sequences over finite fields

, 2016
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity.
Mérai, László, Niederreiter, Harald, Winterhof, Arne   +2 more
core   +1 more source

Progress on Polynomial Identity Testing - II [PDF]

, 2014
We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years.Comment: 17 pages, 1 figure ...
Saxena, Nitin
core   +2 more sources

Random and exhaustive generation of permutations and cycles

, 2007
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known.
D. Gries, D.E. Knuth, D.E. Knuth, H.M. Mahmoud, M.C. Wilson, Mark C. Wilson, R. Mantaci, S. Sattolo, W. Myrvold   +8 more
core   +3 more sources

The inapproximability for the (0,1)-additive number

, 2016
An {\it additive labeling} of a graph $G$ is a function $ \ell :V(G) \rightarrow\mathbb{N}$, such that for every two adjacent vertices $ v $ and $ u$ of $ G $, $ \sum_{w \sim v}\ell(w)\neq \sum_{w \sim u}\ell(w) $ ($ x \sim y $ means that $ x $ is ...
Ahadi, Arash, Dehghan, Ali
core   +2 more sources

mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography

Journal of Mathematical Cryptology
We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z.
Cianfriglia Marco, Onofri Elia, Pedicini Marco   +2 more
doaj   +1 more source