Sciweavers

2137 search results - page 124 / 428
» Proving Abstract Non-interference
Sort
View
ASIACRYPT
1999
Springer
15 years 7 months ago
ECC: Do We Need to Count?
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Jean-Sébastien Coron, Helena Handschuh, Dav...
ASIACRYPT
1999
Springer
15 years 7 months ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
IPPS
1999
IEEE
15 years 7 months ago
Examples of Program Composition Illustrating the Use of Universal Properties
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...
Michel Charpentier, K. Mani Chandy
ECOOPW
1999
Springer
15 years 7 months ago
Security Properties of Typed Applets
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
Xavier Leroy, François Rouaix
FSE
1999
Springer
87views Cryptology» more  FSE 1999»
15 years 7 months ago
Attack on Six Rounds of Crypton
Abstract. In this paper we present an attack on a reduced round version of Crypton. The attack is based on the dedicated Square attack. We explain why the attack also works on Cryp...
Carl D'Halluin, Gert Bijnens, Vincent Rijmen, Bart...