activity
20082014
most citedSimultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

9 citations · 33 across the 10 of their papers we have counts for

collaborators

10 papers

cs.LO2014★ 9 cited

Breaking a monad-comonad symmetry between computational effects

Jean-Guillaume Dumas, Dominique Duval, Jean-Claude Reynaud

Computational effects may often be interpreted in the Kleisli category of a monad or in the coKleisli category of a comonad. The duality between monads and comonads corresponds, in…

cs.LO2012

Adjunctions for exceptions

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1

An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch…

cs.LO2012

Decorated proofs for computational effects: Exceptions

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1

We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This p…

cs.LO2011★ 1 cited

A duality between exceptions and states

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1

In this short note we study the semantics of two basic computational effects, exceptions and states, from a new point of view. In the handling of exceptions we dissociate the contr…

cs.PL2011★ 8 cited

Decorated proofs for computational effects: States

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1

The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs abo…

cs.CR2011

Recursive double-size fixed precision arithmetic

Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse +1

This work is a part of the SHIVA (Secured Hardware Immune Versatile Architecture) project whose purpose is to provide a programmable and reconfigurable hardware module with high le…

cs.CR2010★ 3 cited

Benaloh's Dense Probabilistic Encryption Revisited

Laurent Fousse, Pascal Lafourcade, Mohamed Alnuaimi

In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous p…

cs.LO2010★ 3 cited

States and exceptions considered as dual effects

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse +1

In this paper we consider the two major computational effects of states and exceptions, from the point of view of diagrammatic logics. We get a surprising result: there exists a sy…

cs.SC2008★ 9 cited

Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform severa…

cs.SC2008

Compressed Modular Matrix Multiplication

Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy

We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing severa…