11,412 research outputs found
The Rabin cryptosystem revisited
The Rabin public-key cryptosystem is revisited with a focus on the problem of
identifying the encrypted message unambiguously for any pair of primes. In
particular, a deterministic scheme using quartic reciprocity is described that
works for primes congruent 5 modulo 8, a case that was still open. Both
theoretical and practical solutions are presented. The Rabin signature is also
reconsidered and a deterministic padding mechanism is proposed.Comment: minor review + introduction of a deterministic scheme using quartic
reciprocity that works for primes congruent 5 modulo
Optimized Load Centroid and Rabin Onion Secured Routing in Wireless Sensor Network for IoT
Advances in wireless communication have geared up extensive insights wherein the sensors can themselves communicate with other sensors that form significant parts of the Internet of Things (IoT). However, the large-scale acceptance of WSN for IoT is still surfacing threats and controversies that apprehend the security aspects. There are a lot of attacks that can manipulate the routein WSN for IoT. In this work, an Optimized Load Centroid and Rabin Onion Routing (OLC-ROR) method are designed to improve the throughput rate with minimum routing overhead and latency. The proposed method is based on a Centroid and Rabin Signature, a Digital Signature technique. First, the optimal route is identified by considering both the load and residual energy using Load Centroid function. Then onion routing is used for selecting secured route amongst the optimality. Besides, the node genuineness is checked by applying the Rabin Signature
Optimized Load Centroid and Rabin Onion Secured Routing in Wireless Sensor Network for IoT
Advances in wireless communication have geared up extensive insights wherein the sensors can themselves communicate with other sensors that form significant parts of the Internet of Things (IoT). However, the large-scale acceptance of WSN for IoT is still surfacing threats and controversies that apprehend the security aspects. There are a lot of attacks that can manipulate the routein WSN for IoT. In this work, an Optimized Load Centroid and Rabin Onion Routing (OLC-ROR) method are designed to improve the throughput rate with minimum routing overhead and latency. The proposed method is based on a Centroid and Rabin Signature, a Digital Signature technique. First, the optimal route is identified by considering both the load and residual energy using Load Centroid function. Then onion routing is used for selecting secured route amongst the optimality. Besides, the node genuineness is checked by applying the Rabin Signature
A new problem in string searching
We describe a substring search problem that arises in group presentation
simplification processes. We suggest a two-level searching model: skip and
match levels. We give two timestamp algorithms which skip searching parts of
the text where there are no matches at all and prove their correctness. At the
match level, we consider Harrison signature, Karp-Rabin fingerprint, Bloom
filter and automata based matching algorithms and present experimental
performance figures.Comment: To appear in Proceedings Fifth Annual International Symposium on
Algorithms and Computation (ISAAC'94), Lecture Notes in Computer Scienc
Stopping time signatures for some algorithms in cryptography
We consider the normalized distribution of the overall running times of some
cryptographic algorithms, and what information they reveal about the
algorithms. Recent work of Deift, Menon, Olver, Pfrang, and Trogdon has shown
that certain numerical algorithms applied to large random matrices exhibit a
characteristic distribution of running times, which depends only on the
algorithm but are independent of the choice of probability distributions for
the matrices. Different algorithms often exhibit different running time
distributions, and so the histograms for these running time distributions
provide a time-signature for the algorithms, making it possible, in many cases,
to distinguish one algorithm from another. In this paper we extend this
analysis to cryptographic algorithms, and present examples of such algorithms
with time-signatures that are indistinguishable, and others with
time-signatures that are clearly distinct.Comment: 20 page
The Church Synthesis Problem with Parameters
For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the
Church Synthesis Problem concerns the existence and construction of an operator
Y=F(X) such that ψ(X,F(X)) is universally valid over Nat.
B\"{u}chi and Landweber proved that the Church synthesis problem is
decidable; moreover, they showed that if there is an operator F that solves the
Church Synthesis Problem, then it can also be solved by an operator defined by
a finite state automaton or equivalently by an MLO formula. We investigate a
parameterized version of the Church synthesis problem. In this version ψ
might contain as a parameter a unary predicate P. We show that the Church
synthesis problem for P is computable if and only if the monadic theory of
is decidable. We prove that the B\"{u}chi-Landweber theorem can be
extended only to ultimately periodic parameters. However, the MLO-definability
part of the B\"{u}chi-Landweber theorem holds for the parameterized version of
the Church synthesis problem
The Effectiveness of Low-Level Structure-based Approach Toward Source Code Plagiarism Level Taxonomy
Low-level approach is a novel way to detect source code plagiarism. Such
approach is proven to be effective when compared to baseline approach (i.e., an
approach which relies on source code token subsequence matching) in controlled
environment. We evaluate the effectiveness of state of the art in low-level
approach based on Faidhi \& Robinson's plagiarism level taxonomy; real
plagiarism cases are employed as dataset in this work. Our evaluation shows
that state of the art in low-level approach is effective to handle most
plagiarism attacks. Further, it also outperforms its predecessor and baseline
approach in most plagiarism levels.Comment: The 6th International Conference on Information and Communication
Technolog
- …