Sciweavers

849 search results - page 80 / 170
» Secure Applications of Low-Entropy Keys
Sort
View
AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
13 years 10 months ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
ECCC
2000
93views more  ECCC 2000»
13 years 10 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
MSS
2007
IEEE
129views Hardware» more  MSS 2007»
14 years 4 months ago
Cryptographic Security for a High-Performance Distributed File System
Storage systems are increasingly subject to attacks. Cryptographic file systems mitigate the danger of exposing data by using encryption and integrity protection methods and guar...
Roman Pletka, Christian Cachin
ICC
2007
IEEE
254views Communications» more  ICC 2007»
14 years 1 months ago
Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks
Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory...
Yong Wang, Byrav Ramamurthy
CARDIS
2006
Springer
146views Hardware» more  CARDIS 2006»
14 years 1 months ago
SEA: A Scalable Encryption Algorithm for Small Embedded Applications
Most present symmetric encryption algorithms result from a tradeoff between implementation cost and resulting performances. In addition, they generally aim to be implemented effici...
François-Xavier Standaert, Gilles Piret, Ne...