Result 1 to 20 of 44 total
On an infinite family of graphs with information ratio $2 - 1/k$. (English)
Computing 85, No. 1-2, 127-136 (2009).
1
On the impossibility of highly-efficient blockcipher-based hash functions. (English)
J. Cryptology 22, No. 3, 311-329 (2009).
2
Rearrangements of access structures and their realizations in secret sharing schemes. (English)
Discrete Math. 308, No. 21, 4882-4891 (2008).
3
Coding theory and cryptography. (Codierungstheorie und Kryptographie.) (English)
Mathematik Kompakt. Basel: Birkhäuser (ISBN 978-3-7643-8611-5/pbk). viii, 152~p. EUR~18.90; SFR~29.90 (2008).
4
Probabilistic reliability and privacy of communication using multicast in general neighbor networks. (English)
J. Cryptology 21, No. 2, 250-279 (2008).
5
Structural attacks for public key cryptosystems based on Gabidulin codes. (English)
J. Cryptology 21, No. 2, 280-301 (2008).
6
Secret sharing schemes on graphs. (English)
Stud. Sci. Math. Hung. 44, No. 3, 297-306 (2007).
7
Some strings in Dyck paths. (English)
Australas. J. Comb. 39, 49-72 (2007).
8
Strict avalanche criterion over finite fields. (English)
J. Math. Cryptol. 1, No. 1, 65-78 (2007).
9
The combinatorics of cryptographic key establishment. (English)
Hilton, Anthony (ed.) et al., Surveys in combinatorics 2007. Papers from the 21st British combinatorial conference, Reading, UK, July 8‒13, 2007. Cambridge: Cambridge University Press (ISBN 978-0-521-69823-8/pbk). London Mathematical Society Lecture Note Series 346, 223-273 (2007).
10
Periodic solutions of the Burgers-Hopf equation with small parameter and its cellular neural network model. (English)
C. R. Acad. Bulg. Sci. 59, No. 12, 1227-1234 (2006).
11
Genetic algorithms for orthogonal designs. (English)
Australas. J. Comb. 35, 263-272 (2006).
12
Complexity and cryptography. An introduction. (English)
Cambridge: Cambridge University Press (ISBN 0-521-85231-5/hbk; 0-521-61771-5/pbk). xii, 292~p. \sterling~50.00; \$~95.00/hbk; \sterling~23.99; \$~50.00/pbk (2006).
13
Hyperfocused arcs. (English)
Bull. Belg. Math. Soc. - Simon Stevin 12, No. 5, 685-696 (2005).
14
On the second greedy weight for linear codes satisfying the fullrank condition. (English)
J. Syst. Sci. Complex. 18, No. 1, 55-66 (2005).
15
Algorithms for labeling constant weight Gray codes. (English)
Glasg. Math. J. 47, No. 2, 221-236 (2005).
16
A new construction of self-dual codes from projective planes. (English)
Australas. J. Comb. 31, 337-348 (2005).
17
Lower bounds for some Ramsey numbers. (English)
God. Sofij. Univ., Fak. Mat. Inform. 96, 85-87 (2004).
18
Bounds on the vertex Folkman number $F(4,4;5)$. (English)
God. Sofij. Univ., Fak. Mat. Inform. 96, 75-83 (2004).
19
Generalized Turán’s graph theorem. (English)
God. Sofij. Univ., Fak. Mat. Inform. 96, 69-73 (2004).
20
Result 1 to 20 of 44 total
Start
Contact
Print
General Help
