ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Efficient finite field digital-serial multiplier architecture for cryptography applications
Full text PdfPdf (22 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe table of contents
Munich, Germany
Page: 812  
Year of Publication: 2001
ISBN:0-7695-0993-2
Authors
G. Bertoni  Politechnico di Milano, P.zza L. Da Vinci n. 32, I-20133 Milano, Italy
L. Breveglieri  Politechnico di Milano, P.zza L. Da Vinci n. 32, I-20133 Milano, Italy
P. Fragneto  ST Mircroelectronics Agrate Brianza(MI), Via Olivetti 2, I-20041 Agrate B., Italy
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ECSI :
IEEE-CS\DATC : IEEE Computer Society
RAS : RAS
EDAC : Electronic Design Automation Consortium
IEEE-CS\TTTC : Test Technology Technical Council
IFIP WG 10.5 : IFIP WG 10.5
EDAA : European Design Automation Association
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Joseph H. Silverman, Fast Multiplication in Finite Fields GF(2N), Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, p.122-134, August 12-13, 1999
 
2
C. Paar, "Implementation Options for Finite Fields Arithmetic for Elliptic Curve Cryptosystems", Proc. of 3 rd Workshop on Elliptic Curve Cryptosystems, ECC '99, Waterloo, Ontario, Canada, November, 1999
 
3
L. Song , K. K. Parhi, Efficient Finite Field Serial/Parallel Multiplication, Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors, p.72, August 19-23, 1996
 
4
Michael Rosing, Implementing elliptic curve cryptography, Manning Publications Co., Greenwich, CT, 1999
 
5
Alfred J. Menezes , Neal Koblitz, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Norwell, MA, 1994
 
6
G. Bertoni, L. Breveglieri, L. Cantini, P. Fragneto, "Efficient Digit-Serial Recoded Multiplier Architecture for Galois Fields' Int. Rep. n.2000.46, Politecnico di Milano, Milano, Italy, December, 2000

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION
      Subjects: Public key cryptosystems

Additional Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.2 Multiple Data Stream Architectures (Multiprocessors)
          Subjects: Multiple-instruction-stream, multiple-data-stream processors (MIMD)

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computations in finite fields


General Terms:
Algorithms, Design, Performance

Collaborative Colleagues:
G. Bertoni: colleagues
L. Breveglieri: colleagues
P. Fragneto: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player