2967 search results - page 297 / 594 » Cryptology |
163
click to vote
INDOCRYPT
2003
Springer
15 years 12 months ago
2003
Springer
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
194
click to vote
AMC
2005
15 years 6 months ago
2005
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
163
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
189
click to vote
AFRICACRYPT
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
190
click to vote
CTRSA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. PRESENT is a hardware-oriented block cipher suitable for resource constrained environment. In this paper we analyze PRESENT by the multidimensional linear cryptanalysis m...