Number-Theoretic Methods in Cryptology
✍ Scribed by Jerzy Kaczorowski, Josef Pieprzyk, Jacek Pomykała
- Publisher
- Springer International Publishing
- Year
- 2018
- Tongue
- English
- Leaves
- 287
- Series
- Lecture Notes in Computer Science 10737
- Edition
- 1st ed.
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
This book constitutes the refereed post-conference proceedings of the First International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2017, held in Warsaw, Poland, in September 2017.The 15 revised full papers presented in this book together with 3 invited talks were carefully reviewed and selected from 32 initial submissions. The papers are organized in topical sections on elliptic curves in cryptography; public-key cryptography; lattices in cryptography; number theory; pseudorandomness; and algebraic structures and analysis.
✦ Table of Contents
Front Matter ....Pages I-XX
Front Matter ....Pages 1-1
A Crossbred Algorithm for Solving Boolean Polynomial Systems (Antoine Joux, Vanessa Vitse)....Pages 3-21
Front Matter ....Pages 23-23
Generation and Implementation of Cryptographically Strong Elliptic Curves (Przemysław Dąbrowski, Rafał Gliwa, Janusz Szmidt, Robert Wicik)....Pages 25-36
On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP (Michał Wroński, Tomasz Kijko)....Pages 37-47
Explicit Bound for the Prime Ideal Theorem in Residue Classes (Maciej Grześkowiak)....Pages 48-68
Front Matter ....Pages 69-69
Short Solutions to Nonlinear Systems of Equations (Alan Szepieniec, Bart Preneel)....Pages 71-90
A Novel RSA-Like Cryptosystem Based on a Generalization of the Rédei Rational Functions (Nadir Murru, Francesco M. Saettone)....Pages 91-103
Commutativity, Associativity, and Public Key Cryptography (Jacques Patarin, Valérie Nachef)....Pages 104-117
Front Matter ....Pages 119-119
Computational Differential Privacy from Lattice-Based Cryptography (Filipp Valovich, Francesco Aldà)....Pages 121-141
Explicit Formula for Gram-Schmidt Vectors in LLL with Deep Insertions and Its Applications (Junpei Yamaguchi, Masaya Yasuda)....Pages 142-160
Front Matter ....Pages 161-161
Factoring n and the Number of Points of Kummer Hypersurfaces mod n (Robert Dryło, Jacek Pomykała)....Pages 163-177
Detection of Primes in the Set of Residues of Divisors of a Given Number (Rafał Bystrzycki)....Pages 178-194
Front Matter ....Pages 195-195
The Measures of Pseudorandomness and the NIST Tests (László Mérai, Joël Rivat, András Sárközy)....Pages 197-216
On the Cross-Combined Measure of Families of Binary Lattices and Sequences (Katalin Gyarmati)....Pages 217-238
Front Matter ....Pages 239-239
The Cube Attack on Courtois Toy Cipher (Janusz Szmidt)....Pages 241-253
Near Butson-Hadamard Matrices and Nonlinear Boolean Functions (Sibel Kurt, Oğuz Yayla)....Pages 254-266
Multi-secret Sharing Scheme for Level-Ordered Access Structures (Appala Naidu Tentu, Abdul Basit, K. Bhavani, V. Ch. Venkaiah)....Pages 267-278
Back Matter ....Pages 279-279
✦ Subjects
Computer Science; Data Encryption; Discrete Mathematics in Computer Science; Algorithms; Number Theory; Software Engineering/Programming and Operating Systems; Computing Milieux
📜 SIMILAR VOLUMES
<p>The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. I
<p>This volume contains the proceedings of the very successful second China-Japan Seminar held in lizuka, Fukuoka, Japan, during March 12-16, 2001 under the support of the Japan Society for the Promotion of Science (JSPS) and the National Science Foundation of China (NSFC), and some invited papers o
<span>This book makes a substantial contribution to the understanding of a murky area of number theory that is important to computer science, an area relevant to the design and analysis of number-theoretic algorithms and to the construction of cryptographic protocols.<br><br></span><span>Contents:</
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important: algorithms for primality