Sciweavers

140 search results - page 1 / 28
» Doing More with Fewer Bits
Sort
View
ASIACRYPT
1999
Springer
13 years 9 months ago
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered secu...
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheu...
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
13 years 9 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
13 years 5 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
ESORICS
2008
Springer
13 years 7 months ago
Termination-Insensitive Noninterference Leaks More Than Just a Bit
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...
Aslan Askarov, Sebastian Hunt, Andrei Sabelfeld, D...
DATE
2007
IEEE
56views Hardware» more  DATE 2007»
13 years 11 months ago
Unknown blocking scheme for low control data volume and high observability
This paper presents a new blocking logic to block unknowns for temporal compactors. The proposed blocking logic can reduce data volume required to control the blocking logic and a...
Seongmoon Wang, Wenlong Wei, Srimat T. Chakradhar