Sciweavers

281 search results - page 33 / 57
» Non-black-box Techniques in Cryptography
Sort
View
ICALP
2011
Springer
13 years 1 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 9 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
14 years 4 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
AES
2004
Springer
135views Cryptology» more  AES 2004»
14 years 3 months ago
Some Algebraic Aspects of the Advanced Encryption Standard
Abstract. Since being officially selected as the new Advanced Encryption Standard (AES), Rijndael has continued to receive great attention and has had its security continuously eva...
Carlos Cid
CCS
2003
ACM
14 years 3 months ago
Establishing pairwise keys in distributed sensor networks
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. Ho...
Donggang Liu, Peng Ning