Versatile Processor for GF(p^m) Arithmetic for use in Cryptographic Applications

Typeset version

 

TY  - JOUR
  - Byrne A., Popovici E.; Marnane W.,
  - 2008
  - July
  - IET Computers ; Digital Techniques
  - Versatile Processor for GF(p^m) Arithmetic for use in Cryptographic Applications
  - Published
  - ()
  - 2
  - 4
  - 253
  - 264
  - There has been a lot of research in recent years into the implementation of cryptographic algorithms over GF(2^m), GF(p^m), p >= 2 and GF(p), p large prime. A general architecture for a cryptographic processor capable of handling operations for elliptic curve cryptosystems and pairings over any field, and the software developed to generate it, is introduced. The processor implements a ROM instruction set to simplify control of the system and reduce hardware complexity. Efficient scheduling of the data is used to determine the optimum resource requirement for the processor. The post place and route results for a number of generated elliptic curve processors are given.
  - 1751-8601
  - 10.1049/iet-cdt:20070077
  - Enterprise Ireland
  - Enterprise Ireland Commercialisation Fund Technology Development programme, (TD/2005/204)
DA  - 2008/07
ER  - 
@article{V1194770,
   = {Byrne A., Popovici E. and  Marnane W.,},
   = {2008},
   = {July},
   = {IET Computers ; Digital Techniques},
   = {Versatile Processor for GF(p^m) Arithmetic for use in Cryptographic Applications},
   = {Published},
   = {()},
   = {2},
   = {4},
  pages = {253--264},
   = {{There has been a lot of research in recent years into the implementation of cryptographic algorithms over GF(2^m), GF(p^m), p >= 2 and GF(p), p large prime. A general architecture for a cryptographic processor capable of handling operations for elliptic curve cryptosystems and pairings over any field, and the software developed to generate it, is introduced. The processor implements a ROM instruction set to simplify control of the system and reduce hardware complexity. Efficient scheduling of the data is used to determine the optimum resource requirement for the processor. The post place and route results for a number of generated elliptic curve processors are given.}},
  issn = {1751-8601},
   = {10.1049/iet-cdt:20070077},
   = {Enterprise Ireland},
   = {Enterprise Ireland Commercialisation Fund Technology Development programme, (TD/2005/204)},
  source = {IRIS}
}
AUTHORSByrne A., Popovici E.; Marnane W.,
YEAR2008
MONTHJuly
JOURNAL_CODEIET Computers ; Digital Techniques
TITLEVersatile Processor for GF(p^m) Arithmetic for use in Cryptographic Applications
STATUSPublished
TIMES_CITED()
SEARCH_KEYWORD
VOLUME2
ISSUE4
START_PAGE253
END_PAGE264
ABSTRACTThere has been a lot of research in recent years into the implementation of cryptographic algorithms over GF(2^m), GF(p^m), p >= 2 and GF(p), p large prime. A general architecture for a cryptographic processor capable of handling operations for elliptic curve cryptosystems and pairings over any field, and the software developed to generate it, is introduced. The processor implements a ROM instruction set to simplify control of the system and reduce hardware complexity. Efficient scheduling of the data is used to determine the optimum resource requirement for the processor. The post place and route results for a number of generated elliptic curve processors are given.
PUBLISHER_LOCATION
ISBN_ISSN1751-8601
EDITION
URL
DOI_LINK10.1049/iet-cdt:20070077
FUNDING_BODYEnterprise Ireland
GRANT_DETAILSEnterprise Ireland Commercialisation Fund Technology Development programme, (TD/2005/204)