Versatile processor for GF(p(m)) arithmetic for use in cryptographic applications

Typeset version

 

TY  - JOUR
  - Byrne, A,Popovici, E,Marnane, WP
  - 2008
  - July
  - Iet Computers And Digital Techniques
  - Versatile processor for GF(p(m)) arithmetic for use in cryptographic applications
  - Validated
  - ()
  - CHARACTERISTIC-3 CRYPTOSYSTEMS HARDWARE DIVISION
  - 2
  - 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.
  - 10.1049/iet-cdt:20070077
DA  - 2008/07
ER  - 
@article{V243944139,
   = {Byrne,  A and Popovici,  E and Marnane,  WP },
   = {2008},
   = {July},
   = {Iet Computers And Digital Techniques},
   = {Versatile processor for GF(p(m)) arithmetic for use in cryptographic applications},
   = {Validated},
   = {()},
   = {CHARACTERISTIC-3 CRYPTOSYSTEMS HARDWARE DIVISION},
   = {2},
  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.}},
   = {10.1049/iet-cdt:20070077},
  source = {IRIS}
}
AUTHORSByrne, A,Popovici, E,Marnane, WP
YEAR2008
MONTHJuly
JOURNAL_CODEIet Computers And Digital Techniques
TITLEVersatile processor for GF(p(m)) arithmetic for use in cryptographic applications
STATUSValidated
TIMES_CITED()
SEARCH_KEYWORDCHARACTERISTIC-3 CRYPTOSYSTEMS HARDWARE DIVISION
VOLUME2
ISSUE
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_ISSN
EDITION
URL
DOI_LINK10.1049/iet-cdt:20070077
FUNDING_BODY
GRANT_DETAILS