Sciweavers

1562 search results - page 220 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
14 years 13 days ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
14 years 10 days ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
ACNS
2009
Springer
150views Cryptology» more  ACNS 2009»
14 years 6 days ago
How to Compare Profiled Side-Channel Attacks?
Side-channel attacks are an important class of attacks against cryptographic devices and profiled side-channel attacks are the most powerful type of side-channel attacks. In this s...
François-Xavier Standaert, François ...
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
14 years 6 days ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
CISC
2007
Springer
108views Cryptology» more  CISC 2007»
14 years 4 days ago
Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where e...
Christophe Tartary, Josef Pieprzyk, Huaxiong Wang