Advances in Mathematics of Communications
August 2017 , Volume 11 , Issue 3
Select all articles
The concept of parity check matrices of linear binary codes has been extended by Heden [
In this paper, a new constructive approach of determining the first descent point distribution for the
In this paper, a new class of integer-valued Alexis sequences with length N = 2 (mod 4) is proposed and constructed by using integer-valued almost-perfect sequences obtained from three integer-valued elementary sequences. Compared with binary Alexis sequences, the proposed integer-valued Alexis sequences have a larger zero correlation zone (ZCZ). In addition, the maximal energy efficiency of the proposed sequences is investigated.
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery's simultaneous modular inversion can also be used to speed up Pollard rho when running many walks in parallel. We generalize these ideas and exploit the fact that for any two elliptic curve points X and Y, we can efficiently get X-Y when we compute X+Y. We apply these ideas to speed up the baby-step giant-step algorithm. Compared to the previous methods, the new methods can achieve a significant speedup for computing elliptic curve discrete logarithms in small groups or small intervals.
Another contribution of our paper is to give an analysis of the average-case running time of Bernstein and Lange's "grumpy giants and a baby" algorithm, and also to consider this algorithm in the case of groups with efficient inversion.
Our conclusion is that, in the fully-optimised context, both the interleaved BSGS and grumpy-giants algorithms have superior average-case running time compared with Pollard rho. Furthermore, for the discrete logarithm problem in an interval, the interleaved BSGS algorithm is considerably faster than the Pollard kangaroo or Gaudry-Schost methods.
In this paper we focus on protocols for private set intersection (PSI), through which two parties, each holding a set of inputs drawn from a ground set, jointly compute the intersection of their sets. Ideally, no further information than which elements are actually shared is compromised to the other party, yet the input set sizes are often considered as admissible leakage.
In the unconditional setting we evidence that PSI is impossible to realize and that unconditionally secure size-hiding PSI is possible assuming a set-up authority is present in an set up phase. In the computational setting we give a generic construction using smooth projective hash functions for languages derived from perfectly-binding commitments. Further, we give two size-hiding constructions: the first one is theoretical and evidences the equivalence between PSI, oblivious transfer and the secure computation of the AND function. The second one is a twist on the oblivious polynomial evaluation construction of Freedman et al. from EUROCRYPT 2004. We further sketch a generalization of the latter using algebraic-geometric techniques. Finally, assuming again there is a set-up authority (yet not necessarily trusted) we present very simple and efficient constructions that only hide the size of the client's set.
Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the information leakage [
It is well-known that maximum rank distance (MRD) codes can be constructed as generalized Gabidulin codes. However, it was unknown until recently whether other constructions of linear MRD codes exist. In this paper, we derive a new criterion for linear MRD codes as well as an algebraic criterion for testing whether a given linear MRD code is a generalized Gabidulin code. We then use the criteria to construct examples of linear MRD codes which are not generalized Gabidulin codes.
The necessary and sufficient conditions for a class of functions
For an acyclic directed network with multiple pairs of sources and sinks and a set of Menger's paths connecting each pair of source and sink, it is known that the number of mergings among these Menger's paths is closely related to network encoding complexity. In this paper, we focus on networks with two pairs of sources and sinks and we derive bounds on and exact values of two functions relevant to encoding complexity for such networks.
Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An alternative algorithm for factorizing
As a generalization of constacyclic codes, quasi-twisted Hermitian self-dual codes are studied. Using the factorization of
Using a method for constructing binary self-dual codes having an automorphism of odd prime order
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]