Sciweavers

92 search results - page 5 / 19
» Practical Problems with a Cryptographic Protection Scheme
Sort
View
IJNSEC
2011
272views more  IJNSEC 2011»
13 years 2 months ago
Trust Key Management Scheme for Wireless Body Area Networks
With recent advances in wireless sensor networks and embedded computing technologies, miniaturized pervasive health monitoring devices have become practically feasible. In additio...
Mohammed Mana, Mohammed Feham, Boucif Amar Bensabe...
TRUST
2010
Springer
14 years 15 days ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
IACR
2011
132views more  IACR 2011»
12 years 7 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 9 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
14 years 24 days ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof