default search action
Thomas J. Wollinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [p1]Jan Pelzl, Marko Wolf, Thomas J. Wollinger:
Automotive Embedded Systems Applications and Platform Embedded Security Requirements. Secure Smart Embedded Devices, Platforms and Applications 2014: 287-309
2000 – 2009
- 2008
- [i7]Vladyslav Kovtun, Thomas J. Wollinger:
Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates (Updated). IACR Cryptol. ePrint Arch. 2008: 56 (2008) - 2007
- [j7]Marko Wolf, André Weimerskirch, Thomas J. Wollinger:
State of the Art: Embedding Security in Vehicles. EURASIP J. Embed. Syst. 2007 (2007) - [j6]Xinxin Fan, Thomas J. Wollinger, Guang Gong:
Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields. IET Inf. Secur. 1(2): 65-81 (2007) - [c16]Thomas J. Wollinger, Vladyslav Kovtun:
Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates. ITNG 2007: 893-897 - 2006
- [j5]Sandeep S. Kumar, Thomas J. Wollinger, Christof Paar:
Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography. IEEE Trans. Computers 55(10): 1306-1311 (2006) - [c15]Xinxin Fan, Thomas J. Wollinger, Yumin Wang:
Efficient Doubling on Genus 3 Curves over Binary Fields. CT-RSA 2006: 64-81 - [c14]Thomas J. Wollinger, Guido Bertoni, Luca Breveglieri, Christof Paar:
Performance of HECC Coprocessors Using Inversion-Free Formulae. ICCSA (3) 2006: 1004-1012 - 2005
- [j4]Thomas J. Wollinger, Jan Pelzl, Christof Paar:
Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Cryptosystems. IEEE Trans. Computers 54(7): 861-872 (2005) - [c13]Xinxin Fan, Thomas J. Wollinger, Yumin Wang:
Inversion-Free Arithmetic on Genus 3 Hyperelliptic Curves and Its Implementations. ITCC (1) 2005: 642-647 - [i6]Xinxin Fan, Thomas J. Wollinger, Yumin Wang:
Efficient Doubling on Genus 3 Curves over Binary Fields. IACR Cryptol. ePrint Arch. 2005: 228 (2005) - 2004
- [j3]Thomas J. Wollinger, Jan Pelzl, Volker Wittelsberger, Christof Paar, Gökay Saldamli, Çetin Kaya Koç:
Elliptic and hyperelliptic curves on embedded µP. ACM Trans. Embed. Comput. Syst. 3(3): 509-533 (2004) - [j2]Thomas J. Wollinger, Jorge Guajardo, Christof Paar:
Security on FPGAs: State-of-the-art implementations and attacks. ACM Trans. Embed. Comput. Syst. 3(3): 534-574 (2004) - [c12]E. Barteska, Christof Paar, Jan Pelzl, Volker Wittelsberger, Thomas J. Wollinger:
Case Study: Compiler Comparison for an Embedded Cryptographical Application. ESA/VLSI 2004: 589-595 - [c11]Jan Pelzl, Thomas J. Wollinger, Christof Paar:
High Performance Arithmetic for special Hyperelliptic Curve Cryptosystems of Genus Two. ITCC (2) 2004: 513-517 - [c10]Guido Bertoni, Luca Breveglieri, Thomas J. Wollinger, Christof Paar:
Finding Optimum Parallel Coprocessor Design for Genus 2 Hyperelliptic Curve Cryptosystems. ITCC (2) 2004: 538- - [c9]Howon Kim, Thomas J. Wollinger, YongJe Choi, Kyoil Chung, Christof Paar:
Hyperelliptic Curve Coprocessors on a FPGA. WISA 2004: 360-374 - [i5]Guido Bertoni, Luca Breveglieri, Thomas J. Wollinger, Christof Paar:
Finding Optimum Parallel Coprocessor Design for Genus 2 Hyperelliptic Curve Cryptosystems. IACR Cryptol. ePrint Arch. 2004: 29 (2004) - 2003
- [c8]Jan Pelzl, Thomas J. Wollinger, Jorge Guajardo, Christof Paar:
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves. CHES 2003: 351-365 - [c7]Guido Bertoni, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas J. Wollinger:
Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications. CT-RSA 2003: 158-175 - [c6]Thomas J. Wollinger, Christof Paar:
How Secure Are FPGAs in Cryptographic Applications? FPL 2003: 91-100 - [c5]Kai Schramm, Thomas J. Wollinger, Christof Paar:
A New Class of Collision Attacks and Its Application to DES. FSE 2003: 206-222 - [c4]Christof Paar, Thomas J. Wollinger:
Eingebettete Sicherheit und Kryptographie im Automobil: Eine Einführung. GI Jahrestagung (1) 2003: 325-329 - [c3]Jan Pelzl, Thomas J. Wollinger, Christof Paar:
Low Cost Security: Explicit Formulae for Genus-4 Hyperelliptic Curves. Selected Areas in Cryptography 2003: 1-16 - [i4]Jan Pelzl, Thomas J. Wollinger, Jorge Guajardo, Christof Paar:
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update). IACR Cryptol. ePrint Arch. 2003: 26 (2003) - [i3]Jan Pelzl, Thomas J. Wollinger, Christof Paar:
Low Cost Security: Explicit Formulae for Genus 4 Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2003: 97 (2003) - [i2]Thomas J. Wollinger, Christof Paar:
How Secure Are FPGAs in Cryptographic Applications? IACR Cryptol. ePrint Arch. 2003: 119 (2003) - [i1]Jan Pelzl, Thomas J. Wollinger, Christof Paar:
High Performance Arithmetic for Hyperelliptic Curve Cryptosystems of Genus Two. IACR Cryptol. ePrint Arch. 2003: 212 (2003) - 2002
- [c2]Thomas J. Wollinger, Christof Paar:
Hardware architectures proposed for cryptosystems based on hyperelliptic curves. ICECS 2002: 1159-1162 - 2000
- [c1]Thomas J. Wollinger, Min Wang, Jorge Guajardo, Christof Paar:
How Well Are High-End DSPs Suited for the AES Algorithms? AES Algorithms on the TMS320C6x DSP. AES Candidate Conference 2000: 94-105
1990 – 1999
- 1993
- [j1]Franz Penz, Thomas J. Wollinger:
The ObjectWorld, a classless, object-based, visual programming language. OOPS Messenger 4(1): 26-35 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint