![](https://dblp.dagstuhl.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Karl C. Posch
Person information
- affiliation: Graz University of Technology, Austria
SPARQL queries ![](https://dblp.dagstuhl.de/img/new.blue.24x12.png)
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c9]Karl-Christian Posch, Reinhard Posch, Arne Tauber, Thomas Zefferer, Bernd Zwattendorfer:
Secure and Privacy-Preserving eGovernment - Best Practice Austria. Rainbow of Computer Science 2011: 259-269
2000 – 2009
- 2004
- [c8]Johann Großschädl, Karl C. Posch, Stefan Tillich:
Architectural Enhancements to Support Digital Signal Processing and Public-Key Cryptography. WISES 2004: 129-143 - 2000
- [c7]Herbert Leitold, Wolfgang Mayerwieser, Udo Payer, Karl C. Posch, Reinhard Posch, Johannes Wolkerstorfer:
A 155 Mbps Triple-DES Network Encryptor. CHES 2000: 164-174 - [c6]Herbert Leitold, Wolfgang Mayerwieser, Udo Payer, Karl C. Posch, Reinhard Posch, Johannes Wolkerstorfer:
Robustness-Agile Encryptor for ATM Networks. SEC 2000: 231-240
1990 – 1999
- 1999
- [c5]Herbert Leitold, Karl C. Posch, Reinhard Posch:
ISDN Security services. Communications and Multimedia Security 1999: 21-35 - 1998
- [j7]J. Schwemmlein, Karl C. Posch, Reinhard Posch:
RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography. Comput. Secur. 17(7): 637-650 (1998) - 1995
- [j6]Wolfgang Mayerwieser, Karl C. Posch, Reinhard Posch, Volker Schindler:
Testing a High-Speed Data Path: The Design of the RSAs Crypto Chip. J. Univers. Comput. Sci. 1(11): 728-743 (1995) - [j5]Karl C. Posch, Reinhard Posch:
Modulo Reduction in Residue Number Systems. IEEE Trans. Parallel Distributed Syst. 6(5): 449-454 (1995) - 1993
- [j4]Karl C. Posch, Reinhard Posch:
Base extension using a convolution sum in residue number systems. Computing 50(2): 93-104 (1993) - 1992
- [c4]Karl C. Posch, Reinhard Posch:
Residue Number Systems: A Key to Parallelism in Public Key Cryptography. SPDP 1992: 432-435 - 1991
- [c3]P. Lippitsch, Karl C. Posch, Reinhard Posch:
Multiplication as Parallel as Possible. ACPC 1991: 350-358 - 1990
- [j3]Karl C. Posch:
Proceedings of the 1988 IEEE International Conference on Computer Design: VLSI in Computers and Processors : IEEE Computer Society Press, Los Alamitos, CA, USA (1988) 618pp. Comput. Aided Des. 22(4): 254 (1990) - [j2]Karl C. Posch, Reinhard Posch:
Approaching encryption at ISDN speed using partial parallel modulus multiplication. Microprocessing and Microprogramming 29(3): 177-184 (1990)
1980 – 1989
- 1989
- [j1]Karl C. Posch, Dieter W. Fellner
:
The circle-brush algorithm. ACM Trans. Graph. 8(1): 1-24 (1989) - 1988
- [c2]Karl C. Posch:
Objektigeneratoren zur Echtzeitdarstellung von Dreiecken. Austrographics 1988: 139-153 - [c1]Karl C. Posch:
Blocktransferprozessor: Echtzeitdarstellung alphanumerischer Bilder in CEPT-Kodierung. Visualisierungstechniken und Algorithmen 1988: 119-134
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint