Magic numbers in the state hierarchy of finite automata
Information and Computation
The Banknote Anti-forgery System Based on Digital Signature Algorithms
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
Efficient Finite Fields in the Maxima Computer Algebra System
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Design of a Passport Anti-forgery System Based on Digital Signature Schemes
PAISI '09 Proceedings of the Pacific Asia Workshop on Intelligence and Security Informatics
Generalized embedded landscape and its decomposed representation
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A cryptographic solution for general access control
ISC'05 Proceedings of the 8th international conference on Information Security
A public key cryptosystem based on three new provable problems
Theoretical Computer Science
Testing mersenne primes with elliptic curves
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A new scheme for deniable/repudiable authentication
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
A generic algebraic model for the analysis of cryptographic-key assignment schemes
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
Hi-index | 0.00 |
From the Publisher:There are many surprising connections between the theory of numbers, which is one of the oldest branches of mathematics, and computing and information theory. Number theory has important applications in computer organization and security, coding and cryptography, random number generation, hash functions, and graphics. Conversely, number theorists use computers in factoring large integers, determining primes, testing conjectures, and solving other problems. This book takes the reader from elementary number theory, via algorithmic number theory, to applied number theory in computer science. It introduces basic concepts, results, and methods, and discusses their applications in the design of hardware and software, cryptography, and security. It is aimed at undergraduates in computing and information technology, but will also be valuable to mathematics students interested in applications. In this 2nd edition full proofs of many theorems are added and some corrections are made.