The SCEAS System
Navigation Menu

Conferences in DBLP

Cryptographic Hardware and Embedded Systems (CHES) (ches)
1999 (conf/ches/1999)

  1. Brian D. Snow
    We Need Assurance. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:1- [Conf]
  2. Adi Shamir
    Factoring Large Numbers with the Twinkle Device (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:2-12 [Conf]
  3. Ivan Hamer, Paul Chow
    DES Cracking on the Transmogrifier 2a. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:13-24 [Conf]
  4. W. P. Choi, Lee-Ming Cheng
    Modelling the Crypto-Processor from Design to Synthesis. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:25-36 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:37-48 [Conf]
  6. Eunjong Hong, Jai-Hoon Chung, Chae Hoon Lim
    Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:49-60 [Conf]
  7. Kouichi Itoh, Masahiko Takenaka, Naoya Torii, Syouji Temma, Yasushi Kurihara
    Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:61-72 [Conf]
  8. Pil Joong Lee, Eun Jeong Lee, Yong Duk Kim
    How to Implement Cost-Effective and Secure Public Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:73-79 [Conf]
  9. Colin D. Walter
    Montgomery's Multiplication Technique: How to Make It Smaller and Faster. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:80-93 [Conf]
  10. Alexandre F. Tenca, Çetin Kaya Koç
    A Scalable Architecture for Montgomery Multiplication. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:94-108 [Conf]
  11. Tamás Horváth
    Arithmetic Design for Permutation Groups. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:109-121 [Conf]
  12. Joseph H. Silverman
    Fast Multiplication in Finite Fields GF(2N). [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:122-134 [Conf]
  13. Burton S. Kaliski Jr., Moses Liskov
    Efficient Finite Field Basis Conversion Involving Dual Bases. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:135-143 [Conf]
  14. Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan
    Power Analysis Attacks of Modular Exponentiation in Smartcards. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:144-157 [Conf]
  15. Louis Goubin, Jacques Patarin
    DES and Differential Power Analysis (The "Duplication" Method). [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:158-172 [Conf]
  16. Paul N. Fahn, Peter K. Pearson
    IPA: A New Class of Power Attacks. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:173-186 [Conf]
  17. Eberhard von Faber
    Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:187-203 [Conf]
  18. Vittorio Bagini, Marco Bucci
    A Design of Reliable True Random Number Generator for Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:204-218 [Conf]
  19. David Paul Maher, Robert J. Rance
    Random Number Generators Founded on Signal and Information Theory. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:219-230 [Conf]
  20. R. Reed Taylor, Seth Copen Goldstein
    A High-Performance Flexible Architecture for Cryptography. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:231-245 [Conf]
  21. Emeka Mosanya, Christof Teuscher, Héctor Fabio Restrepo, Patrick Galley, Eduardo Sanchez
    CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:246-256 [Conf]
  22. Lijun Gao, Sarvesh Shrivastava, Gerald E. Sobelman
    Elliptic Curve Scalar Multiplier Design Using FPGAs. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:257-268 [Conf]
  23. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
    Highly Regular Architectures for Finite Field Computation Using Redundant Basis. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:269-279 [Conf]
  24. Huapeng Wu
    Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:280-291 [Conf]
  25. Jean-Sébastien Coron
    Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:292-302 [Conf]
  26. Helena Handschuh, Pascal Paillier, Jacques Stern
    Probing Attacks on Tamper-Resistant Devices. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:303-315 [Conf]
  27. Julio López, Ricardo Dahab
    Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:316-327 [Conf]
  28. Michael Hartmann, Sachar Paulus, Tsuyoshi Takagi
    NICE - New Ideal Coset Encryption. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:328-339 [Conf]
  29. Oliver Jung, Christoph Ruland
    Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:340-352 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002