Open Problems in Mathematics and Computational Science

Author:   Çetin Kaya Koç
Publisher:   Springer International Publishing AG
Edition:   Softcover reprint of the original 1st ed. 2014
ISBN:  

9783319364971


Pages:   439
Publication Date:   06 October 2016
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $145.17 Quantity:  
Add to Cart

Share |

Open Problems in Mathematics and Computational Science


Add your own review!

Overview

Full Product Details

Author:   Çetin Kaya Koç
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   Softcover reprint of the original 1st ed. 2014
Dimensions:   Width: 15.50cm , Height: 2.30cm , Length: 23.50cm
Weight:   0.916kg
ISBN:  

9783319364971


ISBN 10:   3319364979
Pages:   439
Publication Date:   06 October 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

This is a worthwhile collection, especially for young researchers. (J. H. Davenport, Computing Reviews, October, 2015)


This is a worthwhile collection, especially for young researchers. (J. H. Davenport, Computing Reviews, October, 2015)


Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List