History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 | next | last

Result 1 to 20 of 20 total

GHB$^{\#}$: a provably secure HB-like lightweight authentication protocol. (English)
Bao, Feng (ed.) et al., Applied cryptography and network security. 10th international conference, ACNS 2012, Singapore, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31283-0/pbk). Lecture Notes in Computer Science 7341, 489-506 (2012).
1
Designing secure RFID authentication protocols is (still) a non-trivial task (English)
NSS, 73-80 (2011).
2
Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity. (English)
Discrete Appl. Math. 158, No. 18, 2049-2055 (2010).
3
On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks. (English)
Des. Codes Cryptography 57, No. 3, 283-292 (2010).
4
An agent based back-end RFID tag management system. (English)
Katsikas, Sokratis (ed.) et al., Trust, privacy and security in digital business. 7th international conference, TrustBus 2010, Bilbao, Spain, August 30‒31, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15151-4/pbk). Lecture Notes in Computer Science 6264, 165-176 (2010).
5
New constructions of high-performance low-complexity convolutional codes (English)
IEEE Transactions on Communications 58, No. 7, 1950-1961 (2010).
6
On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation (English)
IEEE Transactions on Information Theory 56, No. 8, 4014-4024 (2010).
7
An agent based back-end RFID tag management system (English)
TrustBus, 165-176 (2010).
8
HB-MAC: Improving the Random-HB$^{\#}$ authentication protocol. (English)
Fischer-Hübner, Simone (ed.) et al., Trust, privacy and security in digital business. 6th international conference, TrustBus 2009, Linz, Austria, September 3‒4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03747-4/pbk). Lecture Notes in Computer Science 5695, 159-168 (2009).
9
{\it HB} - {\it MAC}: improving the {\it random} - {\it HB}$^{#}$ authentication protocol (English)
TrustBus, 159-168 (2009).
10
Message origin authentication and integrity protection in chaos-based optical communication (English)
ICC, 1-5 (2009).
11
New constructions of low-complexity convolutional codes (English)
ICC, 1-6 (2009).
12
Remarks on the new attack on the filter generator and the role of high order complexity. (English)
Galbraith, Steven D. (ed.), Cryptography and coding. 11th IMA international conference, Cirencester, UK, December 18‒20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77271-2/pbk). Lecture Notes in Computer Science 4887, 204-219 (2007).
13
Remarks on the new attack on the filter generator and the role of high order complexity (English)
IMA Int. Conf., 204-219 (2007).
14
Constructing periodic binary sequences with maximum nonlinear span. (English)
IEEE Trans. Inf. Theory 52, No. 9, 4257-4261 (2006).
15
On the quadratic span of binary sequences. (English)
IEEE Trans. Inf. Theory 51, No. 5, 1840-1848 (2005).
16
Results on the nonlinear span of binary sequences. (English)
IEEE Trans. Inf. Theory 51, No. 4, 1555-1563 (2005).
17
Minimum linear span approximation of binary sequences. (English)
IEEE Trans. Inf. Theory 48, No. 10, 2758-2764 (2002).
18
First-order optimal approximation of binary sequences. (English)
Helleseth, Tor (ed.) et al., Sequences and their applications. Proceedings of the 2nd international conference (SETA’01), Bergen, Norway, May 13-17, 2001. London: Springer. Discrete Mathematics and Theoretical Computer Science. 242-256 (2002).
Classification: E.4
19
Minimum linear span approximation of binary sequences (English)
IEEE Transactions on Information Theory 48, No. 10, 2758-2764 (2002).
20
first | previous | 1 | next | last

Result 1 to 20 of 20 total