We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
This paper reports on an empirical study that uses a Grounded Theory approach to investigate the creative practices of Machinima filmmakers. Machinima is a new digital film produc...
Nicholas Davis, Boyang Li, Brian O'Neill, Mark Rie...
In this paper we discuss the role of open-source hardware in supporting creativity. We use the case study of an opensource FM radio and explore the modes of creation that emerged ...
This paper discusses Paradigm, a game of intuition and pattern exploration. We offer a sample case study aimed at illustrating the game’s relevance as a microdomain for studying...
Science-fiction and fantasy stories often contain objects never envisioned previously. Inventing gadgets like lightsabers or mythical creatures like griffins is a creative task. T...
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...