This book presents interesting, important unsolved problems in the mathematical and computational sciences. The contributing authors are leading researchers in their fields and they explain outstanding challenges in their domains, first by offering basic definitions, explaining the context, and summarizing related algorithms, theorems, and proofs, and then by suggesting creative solutions.
The authors feel a strong motivation to excite deep research and discussion in the mathematical and computational sciences community, and the book will be of value to postgraduate students and researchers in the areas of theoretical computer science, discrete mathematics, engineering, and cryptology.
Reviews / Votes
"This is a worthwhile collection, especially for
young researchers." (J. H. Davenport, Computing Reviews, October, 2015)
Edition
Softcover reprint of the original 1st ed. 2014
Language
Place of publication
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
12 farbige Abbildungen, 79 s/w Abbildungen
VIII, 439 p. 91 illus., 12 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 25 mm
Weight
ISBN-13
978-3-319-36497-1 (9783319364971)
DOI
10.1007/978-3-319-10683-0
Schweitzer Classification
Prof. Çetin Kaya Koç is a research professor in the Dept. of Computer Science and the College of Creative Studies at the University of California, Santa Barbara. He received his Ph.D. in Electrical and Computer Engineering from UCSB in 1988, and was an assistant professor at the University of Houston, and a full professor at Oregon State University. He cofounded the Workshop on Cryptographic Hardware and Embedded Systems, and he is the founding Editor-in-Chief of the Journal of Cryptographic Hardware. His research interests are in cryptographic hardware and embedded systems, secure hardware design, side-channel attacks and countermeasures, algorithms, and architectures for computer arithmetic and finite fields. He was elected as an IEEE Fellow for his contributions to cryptographic engineering.
About Open Problems.- The Past, Evolving Present, and Future of the Discrete Logarithm.- Isogenies in Theory and Praxis.- Another Look at Security Theorems for 1-Key Nested MACs.- Non-extendable Fq-Quadratic Perfect Nonlinear Maps.- Open Problems for Polynomials over Finite Fields and Applications.- Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers.- Open Problems on the Crosscorrelation of m-Sequences.- Open Problems on With-Carry Sequence Generators.- Open Problems on Binary Bent Functions.- On Semi-bent functions and Related Plateaued Functions over the Galois field F2n.- True Random Number Generators.- How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling.- Theoretical Parallel Computing Models for GPU Computing.- Membrane Computing: Basics and Frontiers.- A Panorama of Post-quantum Cryptography.
