default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCryptography and Communications, Volume 1
Volume 1, Number 1, April 2009
- Claude Carlet:
Editorial: Cryptography and Communications, Volume 1, Issue 1. 1-2 - Fang-Wei Fu, Harald Niederreiter, Ferruh Özbudak
:
Joint linear complexity of multisequences consisting of linear recurring sequences. 3-29 - Charles J. Colbourn, Yuichiro Fujiwara:
Small stopping sets in Steiner triple systems. 31-46 - Joan Daemen, Vincent Rijmen:
New criteria for linear maps in AES-like ciphers. 47-69 - Martin Hell, Thomas Johansson, Lennart Brynielsson:
An overview of distinguishing attacks on stream ciphers. 71-94 - Ramakanth Kavuluru, Andrew Klapper:
Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. 95-116 - Wilfried Meidl:
How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences. 117-133
Volume 1, Number 2, September 2009
- Somitra Kumar Sanadhya, Palash Sarkar:
A combinatorial analysis of recent attacks on step reduced SHA-2 family. 135-173 - Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis:
Factorization of determinants over finite fields and application in stream ciphers. 175-205 - Hong Xu, Wen-Feng Qi, Yonghui Zheng:
Autocorrelations of l-sequences with prime connection integer. 207-223 - Goutam Paul, Subhamoy Maitra:
On biases of permutation and keystream bytes of RC4 towards the secret key. 225-268 - Aleksandar Kircanski, Rabeah Al-Zaidy, Amr M. Youssef:
A new distinguishing and key recovery attack on NGG stream cipher. 269-282
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
