Results 1 
7 of
7
Making NTRU as secure as worstcase problems over ideal lattices
 In Proc. of EUROCRYPT, volume 6632 of LNCS
, 2011
"... Abstract. NTRUEncrypt, proposed in 1996 by Ho stein, Pipher and Silverman, is the fastest known latticebased encryption scheme. Its moderate keysizes, excellent asymptotic performance and conjectured resistance to quantum computers could make it a desirable alternative to factorisation and discret ..."
Abstract

Cited by 30 (5 self)
 Add to MetaCart
(Show Context)
Abstract. NTRUEncrypt, proposed in 1996 by Ho stein, Pipher and Silverman, is the fastest known latticebased encryption scheme. Its moderate keysizes, excellent asymptotic performance and conjectured resistance to quantum computers could make it a desirable alternative to factorisation and discretelog based encryption schemes. However, since its introduction, doubts have regularly arisen on its security. In the present work, we show how to modify NTRUEncrypt to make it provably secure in the standard model, under the assumed quantum hardness of standard worstcase lattice problems, restricted to a family of lattices related to some cyclotomic elds. Our main contribution is to show that if the secret key polynomials are selected by rejection from discrete Gaussians, then the public key, which is their ratio, is statistically indistinguishable from uniform over its domain. The security then follows from the already proven hardness of the RLWE problem.
An elliptic curve cryptography based authentication and key agreement protocol for wireless communication
 In 2nd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications Symposium on Information Theory
, 1998
"... We propose an authentication and key agreement protocol for wireless communication based on elliptic curve cryptographic techniques. The proposed protocol requires signi cantly less bandwidth than the AzizDi e and BellerChangYacobi protocols, and furthermore, it has lower computational burden and ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
(Show Context)
We propose an authentication and key agreement protocol for wireless communication based on elliptic curve cryptographic techniques. The proposed protocol requires signi cantly less bandwidth than the AzizDi e and BellerChangYacobi protocols, and furthermore, it has lower computational burden and storage requirements on the user side. The use of elliptic curve cryptographic techniques provide greater security using fewer bits, resulting in a protocol which requires low computational overhead, and thus, making it suitable for wireless and mobile communication systems, including smartcards and handheld devices. 1
Signing on a Postcard
 In Proceedings of Financial Cryptography
, 2000
"... We investigate the problem of signing short messages using a scheme that minimizes the total length of the original message and the appended signature. This line of research was motivated by several postal services interested by stamping machines capable of producing digital signatures. Although ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
(Show Context)
We investigate the problem of signing short messages using a scheme that minimizes the total length of the original message and the appended signature. This line of research was motivated by several postal services interested by stamping machines capable of producing digital signatures. Although several message recovery schemes exist, their security is questionable. This paper proposes variants of DSA and ECDSA allowing partial recovery: the signature is appended to a truncated message and the discarded bytes are recovered by the verification algorithm.
Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three
 IEEE Transactions on Computers
, 2005
"... Department of Computer Science, ..."
Elliptic Curve DSA ECDSA: An Enhanced DSA
"... The Elliptic Curve Digital Signature Algorithm #ECDSA# is the elliptic curve analogue of the Digital Signature Algorithm #DSA#, and is under consideration for standardization by the ANSI X9 committee. Unlike the normal discrete logarithm problem and the integer factorization problem, the elliptic cu ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The Elliptic Curve Digital Signature Algorithm #ECDSA# is the elliptic curve analogue of the Digital Signature Algorithm #DSA#, and is under consideration for standardization by the ANSI X9 committee. Unlike the normal discrete logarithm problem and the integer factorization problem, the elliptic curve discrete logarithm problem has no subexponentialtime algorithm. For this reason, the strengthperkey bit is substantially greater in an algorithm that uses elliptic curves. In this paper, we compare the draft ANSI X9.62 ECDSA to the ANSI X9.30 DSA, the latter of which is identical to FIPS 186 DSS. 1 Introduction Since the introduction of the concept of publickey cryptography by Whit#eld Di#e and Martin Hellman #11# in 1976, the cryptographic importance of the wellstudied discrete logarithm problem's apparentintractability has been recognized. Taher ElGamal #12# #rst described how this problem could be utilized in publickey encryption and digital signature schemes. ElGamal's methods...
Efficient Wireless Security Protocols based on Elliptic Curve Cryptography
, 2000
"... In recent years, the elliptic curve cryptosystems (ECC) have received attention due to their increased security with smaller key size which brings the advantage of less storage area and less bandwidth. Elliptic curve cryptography provides a methodology for obtaining highspeed, efficient, and scalab ..."
Abstract
 Add to MetaCart
In recent years, the elliptic curve cryptosystems (ECC) have received attention due to their increased security with smaller key size which brings the advantage of less storage area and less bandwidth. Elliptic curve cryptography provides a methodology for obtaining highspeed, efficient, and scalable implementations of network security protocols. In addition low power consumption and code size reductions are the other benefits of the ECCbased security architectures. In this thesis, we mainly concentrate on public key authentication and key agreement protocols. After discussing several wellknown protocols, we propose an authentication and key agreement protocol for wireless communication based on the elliptic curve cryptographic techniques. The proposed protocol requires significantly less bandwidth than the AzizDiffie and BellerChangYacobi protocols, and furthermore, it has lower computational burden and storage requirements on the user side. Additionally,we present an endtoend mobile user security protocol. The protocol is an improved version of the previous one in terms of security and interoperability. The achievement on the protocol goals and the complete security analysis are also