WorldCat Identities

Smart, Nigel P. (Nigel Paul) 1967-

Works: 44 works in 162 publications in 4 languages and 4,391 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor
Classifications: QA76.9.A25, 005.82
Publication Timeline
Most widely held works about Nigel P Smart
Most widely held works by Nigel P Smart
Elliptic curves in cryptography by Ian F Blake( Book )

35 editions published between 1999 and 2007 in 4 languages and held by 789 WorldCat member libraries worldwide

Elliptic curve cryptography is a major challenger to the dominant RSA/DSA systems, with increased speed, less memory required and smaller key sizes. This book summarises knowledge built up within Hewlett Packard over a number of years
The algorithmic resolution of diophantine equations by Nigel P Smart( Book )

17 editions published in 1998 in English and Undetermined and held by 307 WorldCat member libraries worldwide

XIV.4. Integral points on hyperelliptic and superelliptic curves
Cryptography and coding : 10th IMA International Conference, Cirencester, UK, December 19-21, 2005 : proceedings by Nigel P Smart( Book )

19 editions published in 2005 in English and held by 155 WorldCat member libraries worldwide

Cryptography : an introduction by Nigel P Smart( Book )

7 editions published between 2002 and 2003 in English and held by 92 WorldCat member libraries worldwide

What is computer science? : an information security perspective by Daniel Stephen Page( Book )

9 editions published in 2014 in English and held by 45 WorldCat member libraries worldwide

The remarkable diversity of ideas within the subject of computer science makes it highly rewarding and exciting to study, yet also difficult to describe in essence. This engaging and accessible text addresses the fundamental question: What Is Computer Science? Rather than supplying a brief overview of every relevant topic, the book showcases a set of representative concepts broadly connected by the theme of information security. The presentation of each topic can be treated as a "mini" lecture course, demonstrating how it allows us to solve real problems, as well as how it relates to other subjects. The discussions are further supported by numerous examples and practical hands-on exercises, which together will be sure to whet your appetite for the many fascinating aspects of computer science. Topics and features: Presents a concise introduction to the study of algorithms, and describes how computers work using the example of computer viruses Introduces the concepts of data compression, and error detection and correction Highlights the role of data structures, and how their design can have a profound influence on algorithms that operate on them Explores the topic of web-search, with a specific focus on examples drawn from cryptography and information security Reviews both historic and modern cryptographic schemes, examines how a physical system can leak information, and discusses the idea of randomness Investigates the science of steganography, the hiding of secret data within non-secret data Provides additional supplementary material at an associated website This easy-to-read textbook is an ideal introduction to the study of computer science for students beginning on, or contemplating taking, an undergraduate degree. Teachers wishing to offer a primer on the field will also find the book an excellent educational resource
Australian apprenticeships : research readings( Book )

2 editions published in 2001 in English and held by 22 WorldCat member libraries worldwide

Cryptography made simple by Nigel P Smart( Book )

8 editions published between 2015 and 2016 in English and held by 21 WorldCat member libraries worldwide

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation. The author balances a largely non-rigorous style -- many proofs are sketched only -- with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading. This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus
Cryptography and coding 10th IMA International Conference, Cirencester, UK, December 19 - 21, 2005 ; proceedings( )

1 edition published in 2005 in English and held by 7 WorldCat member libraries worldwide

Arithmetic on superelliptic curves by Steven D Galbraith( Book )

3 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide

Curves of genus 2 with good reduction away from 2, II by J.R Merriman( Book )

1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide

The solution of triangularly connected decomposable form equations by Nigel P Smart( Book )

1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide

A Comparison of direct and indirect methods for computing selmer groups of an elliptic curve by Z Djabri( Book )

2 editions published in 1997 in English and held by 2 WorldCat member libraries worldwide

Algorithms, key sizes and parameters report 2013 recommendations( )

2 editions published between 2013 and 2014 in English and held by 2 WorldCat member libraries worldwide

Elliptic curves in cryptography( )

1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide

Computing the p-Selmer group of an elliptic curve by Z Djabri( Book )

2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide

Krzywe eliptyczne w kryptografii by Ian F Blake( Book )

1 edition published in 2004 in Polish and held by 2 WorldCat member libraries worldwide

Study on cryptographic protocols( )

1 edition published in 2014 in English and held by 0 WorldCat member libraries worldwide

Cryptographic algorithms, when used in networks, are used within a cryptographic protocol. In the ENISA algorithms report of 2013 [113], several protocols were discussed. In this document (which is the sister document of the 2014 report [115]) we extend the work in the 2013 report to cover more categories of protocols. The focus of this report is on decision makers in corporations and governments making decisions as to what protocols to use so as to protect online communications which contain personal data which needs to be kept private. Even if the cryptographic primitives and schemes (discussed in [115]) are deemed secure, their use within a protocol can result in a vulnerability which exposes the supposedly secured data. Another focus of the report is to point out the paucity of work, which demonstrates that standard protocols meet well defined security goals. Thus the report, hopefully, will act as a stimulus to researchers and funders in this area to focus efforts on the important area of cryptographic protocols. Whilst the security of basic cryptographic building blocks, such as primitives and protocols, is well studied and understood, the same cannot be said of cryptographic protocols. The scientific study of such protocols can be said to be still not mature enough. As an example of this infancy we point to the discussion in this document on TLS (Transport Layer Security) security, Section 3.1. The TLS protocol is the protocol used to secure traffic from web-sites to browsers; despite a lot of effort on understanding this protocol in the last few years, basic protocol errors are still being found (e.g. Lucky13 [17]), as well as implementation errors (e.g. HeartBleed [87]). In this report we focus on the former type of problems as opposed to the latter type of problems
Algorithms, key size and parameters report - 2014( )

1 edition published in 2014 in English and held by 0 WorldCat member libraries worldwide

During 2013, ENISA prepared and published its first reports with cryptographic guidelines supporting the security measures required to protect personal data in online systems. Recently published EC Regulations on the measures applicable to the notification of personal data breaches [118] make reference to ENISA, as a consultative body, in the process of establishing a list of appropriate cryptographic protective measures. This report is providing an update of the 2013 report [113] produced by ENISA. As was the case with the report of 2013, the cryptographic guidelines of ENISA should serve as a reference document, and cannot fill in for the existing lack of cryptographic recommendations at EU level. As such we provide rather conservative guiding principles, based on current state-of-the-art research, addressing construction of new systems with a long life cycle.^This report is aimed to be a reference in the area, focusing on commercial online services that collect, store and process the personal data of EU citizens. In the report of 2013 there was a section on protocols; for this year we decided to extend the part on implementation by adding to this report a section on side-channels, random number generation, and key life cycle management. The summary of protocols is now covered in a sister report [114]. It should be noted that this is a technical document addressed to decision makers, in particular specialists designing and implementing cryptographic solutions, within commercial organisations. In this document we focus on just two decisions which we feel are more crucial to users of cryptography. Firstly, whether a given primitive or scheme can be considered for use today if it is already deployed. We refer to such use as legacy use within our document.^Our first guiding principle is that if a scheme is not considered suitable for legacy use, or is only considered for such use with certain caveats, then this should be taken as a strong advise that the primitive or scheme should be replaced as a matter of urgency. Secondly, we consider the issue of whether a primitive or scheme is suitable for deployment in new or future systems. In some sense mechanisms which we consider usable for new and future systems meet cryptographic requirements described in this document; they generally will have proofs of security, will have key sizes equivalent to 128-bit symmetric security or more, will have no structural weaknesses, will have been well studied, will have been been standardized, and will have a reasonably-sized existing user base.^Thus the second guiding principle is that decision makers now make plans and preparations for the phasing out of what we term legacy mechanisms over a period of say 5-10 years, and replacing them with systems we deem secure for future use. This document does not consider any mechanisms which are currently only of academic interest. In particular all the mechanisms we discuss have been standardized to some extent, and have either been deployed, or are slated to be deployed, in real systems. This selection is a means of focusing the document on mechanisms which will be of interest to decision makers in industry and government. Further limitations of scope are mentioned in the introductory chapter which follows. Further restrictions are mentioned in Chapter 2 "How to Read this Document". Such topics, which are not explored by this document, could however be covered in the future
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.33 (from 0.18 for The algori ... to 0.98 for Krzywe eli ...)

Elliptic curves in cryptographyElliptic curves in cryptography
Alternative Names
Nigel Smart britischer Mathematiker

Nigel Smart British cryptographer

Nigel Smart Brits cryptograaf

Smart, N.

Smart, N. 1967-

Smart, N. P.

Smart, N. P. 1967-

Smart, N. P. (Nigel Paul), 1967-

Smart, Nigel.

Smart, Nigel 1967-

Smart, Nigel P.

Smart, Nigel Paul

Smart, Nigel Paul 1967-

スマート, ナイジェル・P

The algorithmic resolution of diophantine equationsCryptography and coding : 10th IMA International Conference, Cirencester, UK, December 19-21, 2005 : proceedingsCryptography : an introductionCryptography and coding 10th IMA International Conference, Cirencester, UK, December 19 - 21, 2005 ; proceedingsElliptic curves in cryptography