Result 1 to 20 of 40 total
Ensuring message embedding in wet paper steganography. (English)
Chen, Liqun (ed.), Cryptography and coding. 13th IMA international conference, IMACC 2011, Oxford, UK, December 12‒15, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25515-1/pbk). Lecture Notes in Computer Science 7089, 244-258 (2011).
1
On constructing homomorphic encryption schemes from coding theory. (English)
Chen, Liqun (ed.), Cryptography and coding. 13th IMA international conference, IMACC 2011, Oxford, UK, December 12‒15, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25515-1/pbk). Lecture Notes in Computer Science 7089, 23-40 (2011).
2
On constructing homomorphic encryption schemes from coding theory (English)
IACR Cryptology ePrint Archive 2011, 309 (2011).
3
An interpolation procedure for list decoding Reed-Solomon codes based on generalized key equations (English)
IEEE Transactions on Information Theory 57, No. 9, 5946-5959 (2011).
4
Ensuring message embedding in wet paper steganography (English)
IMA Int. Conf., 244-258 (2011).
5
On constructing homomorphic encryption schemes from coding theory (English)
IMA Int. Conf., 23-40 (2011).
6
The problem of good codes over the binary field. (Problématique des bons codes sur le corps à deux éléments.) (French)
Augot, Daniel et al., Algèbre et télécommunication. SMF Journée Annuelle, Paris, France, 25‒26 juin 2010. Paris: Société Mathématique de France (ISBN 978-2-85629-310-2/pbk). SMF Journée Annuelle 2010, 3-15 (2010).
7
Algebra and telecommunication. SMF annual conference, Paris, France, June 25‒26, 2010. (Algèbre et télécommunication. SMF Journée Annuelle, Paris, France, 25‒26 juin 2010.) (French ;English)
SMF Journée Annuelle 2010. Paris: Société Mathématique de France (ISBN 978-2-85629-310-2/pbk). 49~p. EUR~12.00 (2010).
8
Special issue: Gröbner bases in cryptography, coding theory, and algebraic combinatorics. Papers based on the presentations at the workshop, Hagenberg, Austria, April 30‒May 6, 2006. (English)
J. Symb. Comput. 44, No. 12, 1608-1723 (2009).
9
A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes. (English)
Sala, Massimiliano (ed.) et al., Gröbner bases, coding, and cryptography. Berlin: Springer (ISBN 978-3-540-93805-7/hbk; 978-3-540-93806-4/ebook). 395-398 (2009).
10
An introduction to linear and cyclic codes. (English)
Sala, Massimiliano (ed.) et al., Gröbner bases, coding, and cryptography. Berlin: Springer (ISBN 978-3-540-93805-7/hbk; 978-3-540-93806-4/ebook). 47-68 (2009).
11
On the decoding of binary cyclic codes with the Newton identities. (English)
J. Symb. Comput. 44, No. 12, 1608-1625 (2009).
12
On formulas for decoding binary cyclic codes. (English)
Comput. Res. Repos. 2007, Article No. 0701070 (2007).
13
A three round authenticated group key agreement protocol for ad hoc networks. (English)
Pervasive Mobile Comput. 3, No. 1, 36-52 (2007).
14
A three round authenticated group key agreement protocol for ad hoc networks (English)
Pervasive and Mobile Computing 3, No. 1, 36-52 (2007).
15
Efficient and dynamic group key agreement in ad hoc networks. (English)
Comput. Res. Repos. 2006, Article No. 0611027 (2006).
16
A family of fast syndrome based cryptographic hash functions. (English)
Dawson, Ed (ed.) et al., Progress in cryptology ‒ Mycrypt 2005. First international conference on cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28‒30, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28938-0/pbk). Lecture Notes in Computer Science 3715, 64-83 (2005).
17
A family of fast syndrome based cryptographic hash functions (English)
Mycrypt, 64-83 (2005).
18
An efficient group key agreement protocol for ad hoc networks (English)
WOWMOM, 576-580 (2005).
19
The works of Madhu Sudan on error-correcting codes. (Les travaux de Madhu Sudan sur les codes correcteurs d’erreurs.) (French)
Gaz. Math., Soc. Math. Fr. 98, 5-13 (2003).
20
Result 1 to 20 of 40 total
Start
Contact
Print
General Help
