The MAGMA algebra system I: the user language
TL;DR: MAGMA as mentioned in this paper is a new system for computational algebra, and the MAGMA language can be used to construct constructors for structures, maps, and sets, as well as sets themselves.
About: This article is published in Journal of Symbolic Computation.The article was published on 1997-10-01 and is currently open access. It has received 7310 citations till now. The article focuses on the topics: Magma (algebra).
Citations
More filters
01 Jan 2009
TL;DR: This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.
Abstract: We propose the first fully homomorphic encryption scheme, solving an old open problem. Such a scheme allows one to compute arbitrary functions over encrypted data without the decryption key—i.e., given encryptions E(m1), ..., E( mt) of m1, ..., m t, one can efficiently compute a compact ciphertext that encrypts f(m1, ..., m t) for any efficiently computable function f.
Fully homomorphic encryption has numerous applications. For example, it enables encrypted search engine queries—i.e., a search engine can give you a succinct encrypted answer to your (boolean) query without even knowing what your query was. It also enables searching on encrypted data; you can store your encrypted data on a remote server, and later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, it improves the efficiency of secure multiparty computation.
In our solution, we begin by designing a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function. We then show how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.
2,427 citations
29 Jun 1997
TL;DR: In this article, the problem of finding quantum error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a trace inner product.
Abstract: The unreasonable effectiveness of quantum computing is founded on coherent quantum superposition or entanglement which allows a large number of calculations to be performed simultaneously. This coherence is lost as a quantum system interacts with its environment. In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.
1,525 citations
21 Oct 2011
TL;DR: A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.
Abstract: The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. The privacy concerns can be satisfactorily addressed if users encrypt the data they send to the cloud. If the encryption scheme is homomorphic, the cloud can still perform meaningful computations on the data, even though it is encrypted.In fact, we now know a number of constructions of fully homomorphic encryption schemes that allow arbitrary computation on encrypted data. In the last two years, solutions for fully homomorphic encryption have been proposed and improved upon, but it is hard to ignore the elephant in the room, namely efficiency -- can homomorphic encryption ever be efficient enough to be practical? Certainly, it seems that all known fully homomorphic encryption schemes have a long way to go before they can be used in practice. Given this state of affairs, our contribution is two-fold.First, we exhibit a number of real-world applications, in the medical, financial, and the advertising domains, which require only that the encryption scheme is "somewhat" homomorphic. Somewhat homomorphic encryption schemes, which support a limited number of homomorphic operations, can be much faster, and more compact than fully homomorphic encryption schemes.Secondly, we show a proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem. The scheme is very efficient, and has reasonably short ciphertexts. Our unoptimized implementation in magma enjoys comparable efficiency to even optimized pairing-based schemes with the same level of security and homomorphic capacity. We also show a number of application-specific optimizations to the encryption scheme, most notably the ability to convert between different message encodings in a ciphertext.
1,053 citations
TL;DR: In this paper, the authors review recent progress in developing potential energy and dipole moment surfaces for polyatomic systems with up to 10 atoms, focusing on global linear least squares fitting of tens of thousands of scattered ab initio energies using a special, compact fitting basis of permutationally invariant polynomials.
Abstract: We review recent progress in developing potential energy and dipole moment surfaces for polyatomic systems with up to 10 atoms. The emphasis is on global linear least squares fitting of tens of thousands of scattered ab initio energies using a special, compact fitting basis of permutationally invariant polynomials in Morse-type variables of all the internuclear distances. The computational mathematics underlying this approach is reviewed first, followed by a review of the practical approaches used to obtain the data for the fits. A straightforward symmetrization approach is also given, mainly for pedagogical purposes. The methods are illustrated for potential energy surfaces for , (H2O)2 and CH3CHO. The relationship of this approach to other approaches is also briefly reviewed.
723 citations
01 Aug 2005
TL;DR: The Four Themes are presented: Parametric inference, tree construction using Singular Value Decomposition, analysis of point mutations in vertebrate genomes, extended statistical models from trees to splits graphs, and applications of interval methods to phylogenetics.
Abstract: Preface Part I. Introduction to the Four Themes: 1. Statistics L. Pachter and B. Sturmfels 2. Computation L. Pachter and B. Sturmfels 3. Algebra L. Pachter and B. Sturmfels 4. Biology L. Pachter and B. Sturmfels Part II. Studies on the Four Themes: 5. Parametric inference R. Mihaescu 6. Polytope propagation on graphs M. Joswig 7. Parametric sequence alignment C. Dewey and K. Woods 8. Bounds for optimal sequence alignment S. Elizalde 9. Inference functions S. Elizalde 10. Geometry of Markov chains E. Kuo 11. Equations defining hidden Markov models N. Bray and J. Morton 12. The EM algorithm for hidden Markov models I. B. Hallgrimsdottir, A. Milowski and J. Yu 13. Homology mapping with Markov random fields A. Caspi 14. Mutagenetic tree models N. Beerenwinkel and M. Drton 15. Catalog of small trees M. Casanellas, L. Garcia and S. Sullivant 16. The strand symmetric model M. Casanellas and S. Sullivant 17. Extending statistical models from trees to splits graphs D. Bryant 18. Small trees and generalized neighbor-joining M. Contois and D. Levy 19. Tree construction using Singular Value Decomposition N. Eriksson 20. Applications of interval methods to phylogenetics R. Sainudiin and R. Yoshida 21. Analysis of point mutations in vertebrate genomes J. Al-Aidroos and S. Snir 22. Ultra-conserved elements in vertebrate genomes M. Drton, N. Eriksson and G. Leung Index.
589 citations
References
More filters
Book•
01 Jan 1971
TL;DR: In this article, the authors present a table of abstractions for categories, including Axioms for Categories, Functors, Natural Transformations, and Adjoints for Preorders.
Abstract: I. Categories, Functors and Natural Transformations.- 1. Axioms for Categories.- 2. Categories.- 3. Functors.- 4. Natural Transformations.- 5. Monics, Epis, and Zeros.- 6. Foundations.- 7. Large Categories.- 8. Hom-sets.- II. Constructions on Categories.- 1. Duality.- 2. Contravariance and Opposites.- 3. Products of Categories.- 4. Functor Categories.- 5. The Category of All Categories.- 6. Comma Categories.- 7. Graphs and Free Categories.- 8. Quotient Categories.- III. Universals and Limits.- 1. Universal Arrows.- 2. The Yoneda Lemma.- 3. Coproducts and Colimits.- 4. Products and Limits.- 5. Categories with Finite Products.- 6. Groups in Categories.- IV. Adjoints.- 1. Adjunctions.- 2. Examples of Adjoints.- 3. Reflective Subcategories.- 4. Equivalence of Categories.- 5. Adjoints for Preorders.- 6. Cartesian Closed Categories.- 7. Transformations of Adjoints.- 8. Composition of Adjoints.- V. Limits.- 1. Creation of Limits.- 2. Limits by Products and Equalizers.- 3. Limits with Parameters.- 4. Preservation of Limits.- 5. Adjoints on Limits.- 6. Freyd's Adjoint Functor Theorem.- 7. Subobjects and Generators.- 8. The Special Adjoint Functor Theorem.- 9. Adjoints in Topology.- VI. Monads and Algebras.- 1. Monads in a Category.- 2. Algebras for a Monad.- 3. The Comparison with Algebras.- 4. Words and Free Semigroups.- 5. Free Algebras for a Monad.- 6. Split Coequalizers.- 7. Beck's Theorem.- 8. Algebras are T-algebras.- 9. Compact Hausdorff Spaces.- VII. Monoids.- 1. Monoidal Categories.- 2. Coherence.- 3. Monoids.- 4. Actions.- 5. The Simplicial Category.- 6. Monads and Homology.- 7. Closed Categories.- 8. Compactly Generated Spaces.- 9. Loops and Suspensions.- VIII. Abelian Categories.- 1. Kernels and Cokernels.- 2. Additive Categories.- 3. Abelian Categories.- 4. Diagram Lemmas.- IX. Special Limits.- 1. Filtered Limits.- 2. Interchange of Limits.- 3. Final Functors.- 4. Diagonal Naturality.- 5. Ends.- 6. Coends.- 7. Ends with Parameters.- 8. Iterated Ends and Limits.- X. Kan Extensions.- 1. Adjoints and Limits.- 2. Weak Universality.- 3. The Kan Extension.- 4. Kan Extensions as Coends.- 5. Pointwise Kan Extensions.- 6. Density.- 7. All Concepts are Kan Extensions.- Table of Terminology.
9,254 citations
Book•
IBM1
TL;DR: This book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques.
Abstract: Recent advances in hardware performance and software technology have made possible a wholly different approach to computational mathematics. Symbolic computation systems have revolutionized the field, building upon established and recent mathematical theory to open new possibilities in virtually every industry. Formerly dubbed Scratchpad, AXIOM is a powerful new symbolic and numerical system developed at the IBM Thomas J. Watson Research Center. AXIOM's scope, structure, and organization make it outstanding among computer algebra systems. AXIOM: The Scientific Computation System is a companion to the AXIOM system. The text is written in a straightforward style and begins with a spirited foreword by David and Gregory Chudnovsky. The book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques. Eighty illustrations and eight pages of color inserts accompany text detailing methods used in the 2D and 3D interactive graphics system, and over 2500 example input lines help the reader solve formerly intractable problems.
272 citations
Book•
01 Jan 1982
TL;DR: A container formed in articulated sections pivotally hinged about fold lines to provide ready access to end panels of retained packages for price-marking purposes.
Abstract: A container formed in articulated sections pivotally hinged about fold lines to provide ready access to end panels of retained packages for price-marking purposes. The container itself and a center separator are each formed from a one-piece sheet blank.
225 citations