Light combinators for finite fields arithmetic
TL;DR: This work completes the definition of a library which provides the basic arithmetic operations in binary finite fields as a set of functional terms with very specific features in Typeable Functional Assembly (TFA), and proposes the library as a benchmark.
read more
About: This article is published in Science of Computer Programming. The article was published on 01 Nov 2015. and is currently open access. The article focuses on the topics: Combinatory logic & Functional programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Automatic generation of high speed elliptic curve cryptography code
Daniele Canavese
- 01 Jan 2016
TL;DR: This dissertation' ultimate goal is to automatize the whole optimization process of cryptographic code, with a special focus on ECC, able to produce high speed cryptographic code by automatically choosing the best algorithms and applying a number of code-improving techniques inspired by the compiler theory.
2
Abstract machines, optimal reduction, and streams
TL;DR: This paper defines a sequential abstract machine capable of performing directed virtual reduction (DVR) and extends it to its parallel version, whose equivalence is explained through the properties of DVR itself, and describes PELCR as a stream-processing abstract machine, which in principle can also be applied to infinite streams.
References
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs
TL;DR: A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules; these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
2.8K
Handbook of elliptic and hyperelliptic curve cryptography
Henri Cohen,Gerhard Frey,Roberto Avanzi,Christophe Doche,Tanja Lange,Kim Nguyen,Frederik Vercauteren +6 more
- 19 Jul 2005
TL;DR: The introduction to Public-Key Cryptography explains the development of algorithms for computing Discrete Logarithms and their applications in Pairing-Based Cryptography and its applications in Fast Arithmetic Hardware Smart Cards.
1.3K
Algorithms for Omega-Regular Games with Imperfect Information
TL;DR: An algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective is given and it is shown that these algorithms are optimal by proving matching lower bounds.