3,753 research outputs found

    Homomorphic encryption and some black box attacks

    Full text link
    This paper is a compressed summary of some principal definitions and concepts in the approach to the black box algebra being developed by the authors. We suggest that black box algebra could be useful in cryptanalysis of homomorphic encryption schemes, and that homomorphic encryption is an area of research where cryptography and black box algebra may benefit from exchange of ideas

    Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time

    Get PDF
    In this paper we describe an algorithm that takes as input a description of a semi-algebraic set SRkS \subset \R^k, defined by a Boolean formula with atoms of the form P>0,P<0,P=0P > 0, P < 0, P=0 for PPR[X1,...,Xk],P \in {\mathcal P} \subset \R[X_1,...,X_k], and outputs the first +1\ell+1 Betti numbers of SS, b0(S),...,b(S).b_0(S),...,b_\ell(S). The complexity of the algorithm is (sd)kO(),(sd)^{k^{O(\ell)}}, where where s = #({\mathcal P}) and d=maxPPdeg(P),d = \max_{P\in {\mathcal P}}{\rm deg}(P), which is singly exponential in kk for \ell any fixed constant. Previously, singly exponential time algorithms were known only for computing the Euler-Poincar\'e characteristic, the zero-th and the first Betti numbers

    Formal Desingularization of Surfaces - The Jung Method Revisited -

    Get PDF
    In this paper we propose the concept of formal desingularizations as a substitute for the resolution of algebraic varieties. Though a usual resolution of algebraic varieties provides more information on the structure of singularities there is evidence that the weaker concept is enough for many computational purposes. We give a detailed study of the Jung method and show how it facilitates an efficient computation of formal desingularizations for projective surfaces over a field of characteristic zero, not necessarily algebraically closed. The paper includes a generalization of Duval's Theorem on rational Puiseux parametrizations to the multivariate case and a detailed description of a system for multivariate algebraic power series computations.Comment: 33 pages, 2 figure

    Maps between curves and arithmetic obstructions

    Get PDF
    Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to address the special case of determining when X and Y are isomorphic. We also discuss an application to factoring polynomials over finite fields.Comment: 8 page

    Computing in Jacobians of projective curves over finite fields

    Full text link
    We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations can be done efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite morphisms, and hence Picard and Albanese maps on Jacobians; generating uniformly random divisors and points on Jacobians; computing Frobenius maps and Kummer maps; and finding a basis for the ll-torsion of the Picard group, where ll is a prime number different from the characteristic of the base field.Comment: 42 page

    Milnor algebras could be isomorphic to modular algebras

    Full text link
    We find and describe unexpected isomorphisms between two very different objects associated to hypersurface singularities. One object is the Milnor algebra of a function, while the other object associated to a singularity is the local ring of the flatness stratum of the singular locus in a miniversal deformation, an invariant of the contact class of a defining function. Such isomorphisms exist for unimodal hypersurface singularities. However, for the moment it is badly understood, which principle causes these isomorphisms and how far this observation generalises. Here we also provide an algorithmic approach for checking algebra isomorphy.Comment: 15 pages, 1 table Correction of the proof of lemma/proposition 4.2. Elimination of some inaccuracies and errors in section 5 (Now Appendix B
    corecore