• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 1999
• 
  Vittorio Bagini, Marco Bucci:
  A Design of Reliable True Random Number Generator for Cryptographic Applications. CHES 1999: 204-218
• 
  W. P. Choi, Lee-Ming Cheng:
  Modelling the Crypto-Processor from Design to Synthesis. CHES 1999: 25-36
• 
  Jean-Sébastien Coron:
  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems. CHES 1999: 292-302
• 
  Eberhard von Faber:
  Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems. CHES 1999: 187-203
• 
  Paul N. Fahn, Peter K. Pearson:
  IPA: A New Class of Power Attacks. CHES 1999: 173-186
• 
  Lijun Gao, Sarvesh Shrivastava, Gerald E. Sobelman:
  Elliptic Curve Scalar Multiplier Design Using FPGAs. CHES 1999: 257-268
• 
  Louis Goubin, Jacques Patarin:
  DES and Differential Power Analysis (The "Duplication" Method). CHES 1999: 158-172
• 
  Ivan Hamer, Paul Chow:
  DES Cracking on the Transmogrifier 2a. CHES 1999: 13-24
• 
  Helena Handschuh, Pascal Paillier, Jacques Stern:
  Probing Attacks on Tamper-Resistant Devices. CHES 1999: 303-315
• 
  Michael Hartmann, Sachar Paulus, Tsuyoshi Takagi:
  NICE - New Ideal Coset Encryption. CHES 1999: 328-339
• 
  Eunjong Hong, Jai-Hoon Chung, Chae Hoon Lim:
  Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton. CHES 1999: 49-60
• 
  Tamás Horváth:
  Arithmetic Design for Permutation Groups. CHES 1999: 109-121
• 
  Kouichi Itoh, Masahiko Takenaka, Naoya Torii, Syouji Temma, Yasushi Kurihara:
  Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201. CHES 1999: 61-72
• 
  Oliver Jung, Christoph Ruland:
  Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks. CHES 1999: 340-352
• 
  Burton S. Kaliski Jr., Moses D. Liskov:
  Efficient Finite Field Basis Conversion Involving Dual Bases. CHES 1999: 135-143
• 
  Pil Joong Lee, Eun Jeong Lee, Yong Duk Kim:
  How to Implement Cost-Effective and Secure Public Key Cryptosystems. CHES 1999: 73-79
• 
  Julio López, Ricardo Dahab:
  Fast Multiplication on Elliptic Curves over GF(2^m) without Precomputation. CHES 1999: 316-327
• 
  David Paul Maher, Robert J. Rance:
  Random Number Generators Founded on Signal and Information Theory. CHES 1999: 219-230
• 
  Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan:
  Power Analysis Attacks of Modular Exponentiation in Smartcards. CHES 1999: 144-157
• 
  Emeka Mosanya, Christof Teuscher, Héctor Fabio Restrepo, Patrick Galley, Eduardo Sanchez:
  CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor. CHES 1999: 246-256
• 
  Adi Shamir:
  Factoring Large Numbers with the Twinkle Device (Extended Abstract). CHES 1999: 2-12
• 
  Joseph H. Silverman:
  Fast Multiplication in Finite Fields GF(2^N). CHES 1999: 122-134
• 
  Brian D. Snow:
  We Need Assurance. CHES 1999: 1
• 
  R. Reed Taylor, Seth Copen Goldstein:
  A High-Performance Flexible Architecture for Cryptography. CHES 1999: 231-245
• 
  Alexandre F. Tenca, Çetin Kaya Koç:
  A Scalable Architecture for Montgomery Multiplication. CHES 1999: 94-108
• 
  Colin D. Walter:
  Montgomery's Multiplication Technique: How to Make It Smaller and Faster. CHES 1999: 80-93
• 
  D. Craig Wilcox, Lyndon G. Pierson, Perry J. Robertson, Edward L. Witzke, Karl Gass:
  A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond. CHES 1999: 37-48
• 
  Huapeng Wu:
  Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis. CHES 1999: 280-291
• 
  Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
  Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279
• 
  Çetin Kaya Koç, Christof Paar:
  Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99, Worcester, MA, USA, August 12-13, 1999, Proceedings. Lecture Notes in Computer Science 1717, Springer 1999, ISBN 3-540-66646-X [contents]