#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1998

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Daniel V. Bailey, Christof Paar
- CRYPTO
- 1998

This contribution introduces a class of Galois eld used to achieve fast nite eld arithmetic which we call an Optimal Extension Field OEF This approach is well suited for implementation of public key cryptosystems based on elliptic and hyperelliptic curves Whereas previous reported optimizations focus on nite elds of the form GF p and GF m an OEF is the… (More)

- Daniel V. Bailey, Christof Paar
- Journal of Cryptology
- 2001

This contribution focuses on a class of Galois field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (OEF), first introduced in [3]. We extend this work by presenting an adaptation of Itoh and Tsujii's algorithm for finite field inversion applied to OEFs. In particular, we use the facts that the action of the Frobenius… (More)

- Ari Juels, Paul F. Syverson, Daniel V. Bailey
- Privacy Enhancing Technologies
- 2005

A basic radio-frequency identification (RFID) tag is a small and inexpensive microchip that emits a static identifier in response to a query from a nearby reader. Basic tags of the “smart-label” variety are likely to serve as a next-generation replacement for barcodes. This would introduce a strong potential for various forms of privacy infringement, such… (More)

The increasing connectivity o ered by constrained computing devices signals a vital need for public-key cryptography in such environments. By their nature, however, public-key systems have been diÆcult to implement in systems with limited computational power. The NTRU public-key cryptosystem addresses this problem by o ering tremendous performance… (More)

- Junfeng Fan, Daniel V. Bailey, Lejla Batina, Tim Güneysu, Christof Paar, Ingrid Verbauwhede
- 2010 International Conference on Field…
- 2010

This paper reports a new speed record for FPGAs in cracking Elliptic Curve Cryptosystems. We conduct a detailed analysis of different $\textbf{F}_{2^m}$ multiplication approaches in this application. A novel architecture using optimized normal basis multipliers is proposed to solve the Certicom challenge ECC2K-130. We compare the FPGA performance against… (More)

- Thomas S. Benjamin, Daniel V. Bailey, Kevin Fu, Ari Juels, Tom O'Hare
- Financial Cryptography
- 2007

RFID-enabled credit cards are widely deployed in the United States and other countries, but no study has thoroughly analyzed the mechanisms that provide both security and privacy. Using samples from a variety of RFID-enabled credit cards, our study observes that (1) the cardholder’s name and often credit card number and expiration are leaked in plaintext to… (More)

- Adam D. Woodbury, Daniel V. Bailey, Christof Paar
- CARDIS
- 2000

This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on the Intel 8051 family of microcontrollers popular in smart cards and other cost-sensitive devices. The implementation is based on the use of the finite fieldGF ((2− 17)) which is… (More)

The EPCglobal Class-1 Generation-2 UHF tag standard is certain to become the de facto worldwide specification for inexpensive RFID tags. Because of its sharp focus on simple “license plate” tags, it supports only the most rudimentary of security and privacy features, and essentially none of the cryptographic techniques that underpin authentication and… (More)

- Daniel V. Bailey, Lejla Batina, +20 authors Bo-Yin Yang
- IACR Cryptology ePrint Archive
- 2009

Elliptic-curve cryptography is becoming the standard public-key primitive not only for mobile devices but also for high-security applications. Advantages are the higher cryptographic strength per bit in comparison with RSA and the higher speed in implementations. To improve understanding of the exact strength of the elliptic-curve discrete-logarithm… (More)

- Daniel V. Bailey, Markus Dürmuth, Christof Paar
- SCN
- 2014

Multiple studies have demonstrated that users select weak passwords. However, the vast majority of studies on password security uses password lists that only have passwords for one site, which means that several important questions cannot be studied. For example, how much stronger are password choices for different categories of sites? We use a dataset… (More)