Sciweavers

1769 search results - page 102 / 354
» Cryptography
Sort
View
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
15 years 8 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
CHES
2004
Springer
148views Cryptology» more  CHES 2004»
15 years 8 months ago
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
We present an implementation of elliptic curves and of hyperelliptic curves of genus 2 and 3 over prime fields. To achieve a fair comparison between the different types of groups,...
Roberto Maria Avanzi
GC
2004
Springer
15 years 8 months ago
Towards a Formal Treatment of Secrecy Against Computational Adversaries
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Angelo Troina, Alessandro Aldini, Roberto Gorrieri
123
Voted
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
15 years 8 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TYPES
2004
Springer
15 years 8 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento