Result 1 to 20 of 80 total
An identity derived from the solution of a class of differential equations for the evolution of a key agreement protocol. (English)
J. Discrete Math. Sci. Cryptography 14, No. 6, 515-520 (2011).
1
Consolidating a heuristic for incremental decision tree learning through asymptotic analysis. (English)
Int. J. Artif. Intell. Tools 20, No. 1, 29-52 (2011).
2
Elliptic curve based zero knowledge proofs and their applicability on resource constrained devices (English)
MASS, 715-720 (2011).
3
Lower bounds for interpolating polynomials for square roots of the elliptic curve discrete logarithm (English)
ISA, 177-187 (2011).
4
A distributed, parametric platform for constructing secure sboxes in block cipher designs (English)
FGIT-SecTech, 155-166 (2011).
5
On the efficient generation of prime-order elliptic curves. (English)
J. Cryptology 23, No. 3, 477-503 (2010).
6
Formal correctness of security protocols by giampaolo bella, Springer-verlag (English)
SIGACT News 41, No. 1, 47-50 (2010).
7
Modeling the co-evololution DNS worms and anti-worms in IPv6 networks (English)
IAS, 171-174 (2009).
8
Can formalism alone provide an answer to the quest of a viable definition of trust in the WWW society? (English)
e-Democracy, 199-208 (2009).
9
Secure elliptic curve generation and key establishment on a 802.11 WLAN embedded device (English)
ISADS, 41-48 (2009).
10
Geometric approaches for creating low power, low interference connectivity patterns in static, structureless sensor networks (English)
ISADS, 237-242 (2009).
11
On the equivalence between random graph models. (English)
J. Discrete Math. Sci. Cryptography 11, No. 4, 405-419 (2008).
12
An interactive, similarity increasing algorithm for random strings with applications to key agreement in ad hoc networks. (English)
Stud. Appl. Math. 121, No. 2, 141-155 (2008).
13
A probabilistic key agreement scheme for sensor networks without key predistribution. (English)
Comput. Res. Repos. 2008, Article No. 0806.1812 (2008).
14
A queuing theory based model for studying intrusion evolution and elimination in computer networks (English)
IAS, 167-171 (2008).
15
A step-wise refinement approach for enhancing e-voting acceptance (English)
ICEGOV, 275-280 (2008).
16
Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography. (English)
Math. Comput. Modelling 46, No. 1-2, 174-179 (2007).
17
An asymptotic expansion for the $q$-binomial series using singularity analysis for generating functions. (English)
J. Discrete Math. Sci. Cryptography 10, No. 3, 313-328 (2007).
18
The unsatisfiability threshold revisited. (English)
Discrete Appl. Math. 155, No. 12, 1525-1538 (2007).
19
Efficient generation of secure elliptic curves. (English)
Int. J. Inf. Secur. 6, No. 1, 47-63 (2007).
20
Result 1 to 20 of 80 total
Start
Contact
Print
General Help
