Sciweavers

1916 search results - page 219 / 384
» Reasoning with class algebra
Sort
View
ASIACRYPT
2009
Springer
14 years 4 months ago
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
Tibor Jager, Jörg Schwenk
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 4 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
AFRICACRYPT
2008
Springer
14 years 4 months ago
Cryptanalysis of the TRMS Signature Scheme of PKC'05
In this paper, we investigate the security of the Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC’05. To do so, we present a hybrid approach for so...
Luk Bettale, Jean-Charles Faugère, Ludovic ...
CSL
2007
Springer
14 years 4 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
TPHOL
2005
IEEE
14 years 3 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts