default search action
Open Problems in Mathematics and Computational Science 2014
- Çetin Kaya Koç:
Open Problems in Mathematics and Computational Science. Springer 2014, ISBN 978-3-319-10682-3 - Çetin Kaya Koç:
About Open Problems. 1-4 - Antoine Joux, Andrew M. Odlyzko, Cécile Pierrot:
The Past, Evolving Present, and Future of the Discrete Logarithm. 5-36 - Gerhard Frey:
Isogenies in Theory and Praxis. 37-68 - Neal Koblitz, Alfred Menezes:
Another Look at Security Theorems for 1-Key Nested MACs. 69-89 - Ferruh Özbudak, Alexander Pott:
Non-extendable Fq-Quadratic Perfect Nonlinear Maps. 91-110 - Daniel Panario:
Open Problems for Polynomials over Finite Fields and Applications. 111-126 - Kalikinkar Mandal, Guang Gong:
Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers. 127-162 - Tor Helleseth:
Open Problems on the Cross-correlation of m-Sequences. 163-179 - Andrew Klapper:
Open Problems on With-Carry Sequence Generators. 181-201 - Claude Carlet:
Open Problems on Binary Bent Functions. 203-241 - Sihem Mesnager:
On Semi-bent Functions and Related Plateaued Functions Over the Galois Field F2n. 243-273 - Mario Stipcevic, Çetin Kaya Koç:
True Random Number Generators. 275-315 - Eric Brier, David Naccache, Li-yao Xia:
How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling. 317-340 - Koji Nakano:
Theoretical Parallel Computing Models for GPU Computing. 341-359 - Gheorghe Paun:
Membrane Computing: Basics and Frontiers. 361-385 - Paulo S. L. M. Barreto, Felipe Piazza Biasi, Ricardo Dahab, Julio César López-Hernández, Eduardo M. de Morais, Ana Karina D. S. de Oliveira, Geovandro C. C. F. Pereira, Jefferson E. Ricardini:
A Panorama of Post-quantum Cryptography. 387-439
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.