Guang Gong – författare

This book provides a comprehensive description of the methodologies and the application areas, throughout the range of digital communication, in which individual signals and sets of signals with favorable correlation properties play a central role. The necessary mathematical background is presented to explain how these signals are generated, and to show how they satisfy the appropriate correlation constraints. All the known methods to obtain balanced binary sequences with two-valued autocorrelation, many of them only recently discovered, are presented in depth. The authors treat important application areas including: Code Division Multiple Access (CDMA) signals, such as those already in widespread use for cell-phone communication, and planned for universal adoption in the various approaches to 'third-generation'(3G) cell-phone use; systems for coded radar and sonar signals; communication signals to minimize mutual interference ('cross-talk') in multi-user environments; and pseudo-random sequence generation for secure authentication and for stream cipher cryptology.

Helping current and future system designers take a more productive approach in the field, Communication System Security shows how to apply security principles to state-of-the-art communication systems. The authors use previous design failures and security flaws to explain common pitfalls in security design.Divided into four parts, the book begins with the necessary background on practical cryptography primitives. This part describes pseudorandom sequence generators, stream and block ciphers, hash functions, and public-key cryptographic algorithms.The second part covers security infrastructure support and the main subroutine designs for establishing protected communications. The authors illustrate design principles through network security protocols, including transport layer security (TLS), Internet security protocols (IPsec), the secure shell (SSH), and cellular solutions.Taking an evolutionary approach to security in today’s telecommunication networks, the third part discusses general access authentication protocols, the protocols used for UMTS/LTE, the protocols specified in IETF, and the wireless-specific protection mechanisms for the air link of UMTS/LTE and IEEE 802.11. It also covers key establishment and authentication in broadcast and multicast scenarios.Moving on to system security, the last part introduces the principles and practice of a trusted platform for communication devices. The authors detail physical-layer security as well as spread-spectrum techniques for anti-jamming attacks.With much of the material used by the authors in their courses and drawn from their industry experiences, this book is appropriate for a wide audience, from engineering, computer science, and mathematics students to engineers, designers, and computer scientists. Illustrating security principles with existing protocols, the text helps readers understand the principles and practice of security analysis.

This book constitutes the revised selected papers of the 12th International Symposium on Foundations and Practice of Security, FPS 2019, held in Toulouse, France, in November 2019.The 19 full papers and 9 short papers presented in this book were carefully reviewed and selected from 50 submissions.

This book constitutes the refereed proceedings of the 4th International Conference on Sequences and Their Applications, SETA 2006. The book presents 32 revised full papers together with 4 invited lectures. The papers are organized in topical sections on linear complexity of sequences, correlation of sequences, stream ciphers and transforms, topics in complexities of sequences, multi-sequence synthesis, sequences and combinatorics, FCSR sequences, aperiodic correlation and applications, and boolean functions, and more.

These are the proceedings of the Workshop on Sequences, Subsequences, and Consequences that was held at the University of Southern California (USC), May 31 - June 2, 2007. There were three one-hour Keynote lectures, 16 invited talks of up to 45 minutes each, and 1 “contributed” paper. The theory of sequences from discrete symbol alphabets has found practical applications in many areas of coded communications and in cryptography, - cluding: signal patterns for use in radar and sonar; spectral spreading sequences for CDMA wireless telephony; key streams for direct sequence stream-cipher cryptography; and a variety of forward-error-correctingcodes. The workshopwasdesigned to bring leading researcherson “sequences”from aroundtheworldtopresenttheirlatestresults,interchangeinformationwithone another, and especially to inform the larger audience of interested participants, includingfaculty,researchers,scholars,andstudentsfromnumerousinstitutions, as well as the readers of these proceedings, about recent developments in this important ?eld. There were invited speakers from Canada, China, Germany, India, Israel, Norway, Puerto Rico, and South Korea, in addition to those from the USA. Support for the workshop was generously provided by the O?ce of the Dean of the Viterbi School of Engineering, by the Center for Communications Research (CCR-La Jolla), and by the United States National Science Foundation (NSF). This support is hereby gratefully acknowledged.

Strong Pseudorandompermutations or SPRPs,which were introduced byLuby andRacko? [4], formalize the well established cryptographic notion ofblock ciphers.They provided a construction of SPRP, well known as LRconstruction, which was motivated by the structure of DES[6].The basicbuildingblock is the so called 2n-bit Feistel permutation (or LR round permutation) LR based F K on an n-bitpseudorandomfunction (PRF) F : K n LR (x ,x)=(F (x )?x ,x ),x ,x?{0,1} . F 1 2 K 1 2 1 1 2 K Theirconstruction consists (see Fig 1) offour rounds of Feistel permutations (or three rounds, for PRP), each round involves an application ofanindependent PRF(i.e.with independentrandomkeys K ,K ,K , and K ). More precisely, 1 2 3 4 LR and LR are PRP and SPRP respectively where K ,K ,K K ,K ,K ,K 1 2 3 1 2 3 4 LR := LR := LR (...(LR (*))...). K ,...,K F ,...,F F F 1 r K K K K r r 1 1 After this work, many results are known improvingperformance (reducingthe number of invocations of F )[5] and reducingthekey-sizes (i.e. reusingthe K roundkeys [7,8,10,12,11] orgenerate more keysfromsinglekey by usinga PRF[2]). However there are some limitations.Forexample,wecannotuseas few as single-keyLR (unless wetweak the roundpermutation) orasfew as two-roundsince they are not secure.Distinguishing attacks forsome other LR constructionsarealso known [8]. We list some oftheknow related results (see Table 1). Here all keys K ,K ,...are independently chosen.