Sciweavers

12194 search results - page 417 / 2439
» cans 2010
Sort
View
IWSEC
2010
Springer
15 years 6 months ago
Publishing Upper Half of RSA Decryption Exponent
In the perspective of RSA, given small encryption exponent e (e.g., e = 216 + 1), the top half of the decryption exponent d can be narrowed down within a small search space. This f...
Subhamoy Maitra, Santanu Sarkar, Sourav Sengupta
JCP
2010
100views more  JCP 2010»
15 years 6 months ago
Provable Secure Generalized Signcryption
Generalized signcryption which proposed by Han is a new cryptographic primitive which can work as an encryption scheme, a signature scheme or a signcryption scheme [5]. However,the...
Xu An Wang, Xiaoyuan Yang, Jindan Zhang
JELIA
2010
Springer
15 years 6 months ago
dl2asp: Implementing Default Logic via Answer Set Programming
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
Yin Chen, Hai Wan, Yan Zhang, Yi Zhou
JOLLI
2010
123views more  JOLLI 2010»
15 years 6 months ago
The Situation Calculus: A Case for Modal Logic
Abstract The situation calculus is one of the most established formalisms for reasoning about action and change. In this paper we will review the basics of Reiter’s version of th...
Gerhard Lakemeyer
JSC
2010
132views more  JSC 2010»
15 years 6 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene