Publications
Scott M.
"Time-Optimal
Control of State Constrained Linear Discrete Systems", in Optimisation
Techniques, Proceedings 8th IFIP Conference on Optimization Techniques,
Dickie, A Scott, M.
"Suboptimality
introduced by Discretisation in Time-Optimal Control Systems", I.E.E.
Proc, Vol. 128, Pt. D, No. 6, 1981
Scott M.
"Puzzle
Solver", Practical Computing, Vol. 7, No. 11, November 1984, pp94-95
Scott M.
"Time/Fuel
Optimal Control of Constrained Linear Discrete Systems", Automatica, Vol.
22, No. 6, pp 711-715, 1986
Scott M.
"M.I.R.A.C.L.
- A Multiprecision Library", The C Users Journal, Vol. 6, No. 4, May 1988,
pp76-80
Scott M.
"Fast
Rounding in Multiprecision Floating-Slash Arithmetic", IEEE Trans. on
Computers", Vol. 38, No. 7, July 1989, pp1049-1052
Scott M.
"The
Ultimate Random Number Generator", .EXE Magazine, November 1992
Shafa’amry, M. Scott M
"DCU-Cipher.
A Secret Key Block Cipher System", International Symposium in Computer
Science and Applied Mathematics, CSAM ’93,
Scott M.
"How
random is your generator", .EXE Magazine, Vol. 8, No. 5, October 1993,
pp44-48
Davern P. Scott M
“The
Application of Fractal Image Compression to Steganography”, Information Hiding
Workshop,
Scott M.
"On
an ID based Key Exchange Scheme", Electronic Letters, April 1998,Vol 34,
No. 7 , pp. 653-654
Scott M.
"Authenticated
ID-based Key Exchange and remote log-in with insecure token and PIN
number". Cryptology ePrint Archive, Report 2002/164
P. S. L. M. Barreto, H. Y.
Kim, B. Lynn, M. Scott,
"Efficient Algorithms for Pairing-Based Cryptosystems", Advances in Cryptology -- Crypto'2002, Lecture Notes in Computer Science 2442, Springer-Verlag (2002), pp. 354-368. See also Cryptology ePrint Archive, Report 2002/008.
This paper is very frequently cited. See here
and here for
details.
Paulo S. L. M. Barreto, B. Lynn, and M. Scott.
“Efficient
implementation of pairing-based cryptosystems”, Journal of Cryptology, 17(4):pp. 321-334, 2004.
P. S. L. M. Barreto, B.
Lynn, M. Scott,
"Constructing
Elliptic Curves with Prescribed Embedding Degrees", Proceedings of the
Third Workshop on Security in Communication Networks (SCN'2002), Lecture
Notes in Computer Science 2576, Springer-Verlag (2003). See also
Cryptology ePrint Archive, Report
2002/088.
Nicolas T. Courtois and Robert
T. Johnson and Pascal Junod and Thomas Pornin and M. Scott
"Did
Filiol break AES?", Cryptology ePrint Archive: Report
2003/022
P. S. L. M. Barreto, B.
Lynn, M. Scott,
"On
the Selection of Pairing-Friendly Groups", Selected Areas in
Cryptography (SAC'2003), Lecture Notes in Computer Science 3006,
Springer-Verlag (2004) pp. 17-25. See also Cryptology ePrint Archive, Report 2003/086
Scott M.
"Cryptanalysis
of an ID-based Password Authentication Scheme using Smart Cards and
Fingerprints", ACM Operating Systems
Review, April 2004, Vol. 38, No. 2, pp.73-75. See also Cryptology ePrint
Archive, Report 2004/017
M. Scott and Paulo S. L. M Barreto
"Generating
more MNT elliptic curves", Designs,
Codes & Cryptography, Vol. 38, No. 2, February 2006. See also
Cryptology ePrint Archive, Report
2004/058
M. Scott and
"Compressed
Pairings", Advances in Cryptology
- Crypto'2004, Santa Barbara, (USA),
Lecture Notes in Computer Science 3152, Springer-Verlag, 2004, pp140-156. See
also Cryptology ePrint Archive, Report
2004/032
Scott M.
"Faster
Identity Based Encryption", Electronic
Letters, July 2004, Vol. 40, No. 14, pp. 861. Slightly updated version
available here. (PDF).
Scott M.
"Computing
the Tate Pairing", CT-RSA
February 2005, San Francisco (
P. S. L. M. Barreto, S. Galbraith, C. O hEigeartaigh and M. Scott
“Efficient Pairing Computation on Supersingular
Abelian Varieties”, See Cryptology
ePrint Archive, Report 2004/375
Scott M. “Scaling security in pairing-based protocols”, See Cryptology ePrint
Archive, Report 2005/139
Scott M. “Pairing
Pseudoprimes”, Workshop on Coding and Cryptography, University College Cork, 23rd
May 2005. Slides here
Scott M. “Faster pairings using an elliptic curve with an
efficient endomorphism”, INDOCRYPT 2005,
Scott M. “Deterministic
Hashing to points on IBE-friendly elliptic curves”, May 2005 (PDF)
Scott M. “A note on Boneh- and
Franklin IBE”, May 2005 (PDF)
Scott M. “Implementing Cryptographic
Pairings”, September 2006 (PDF)
Works-in-Progress
Key exchange
using Lucas Exponentiation
The
idea here is to use Lucas Exponentiation to implement McCurleys method for
provably secure key exchange. The advantage is that an attacker has to solve
both an integer factorisation problem and a discrete logarithm problem of equal
complexity to crack it
On Composite
Diffie-Hellman Key Agreement with Short Exponents
Here
we again extend McCurley's idea, but this time to achieve improved efficiency
by using shorter exponents
Efficient
Short-Password key exchange and Log-in Protocols
This
paper describes new short-password key exchange and log-in protocols. The
advantage over competing schemes like SPEKE and PAK is that it is much faster.
Now if only I had a proof of security…..
Recently
two Japanese Researchers have rediscovered essentially the same method, and
they do have a security proof, at least for the key exchange protocol - see http://search.ieice.or.jp/2002/files/e000a10.htm#e85-a,10,2229
for details.
Authenticated
ID-based Key Exchange and remote log-in with insecure token and PIN number
Here's
how to log-in to a computer securely with a magnetic-strip based card and a PIN
number of your own choosing.