default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Beth
Person information
- 16.11.1949 - 17.08.2005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2008
[j45]Martin Rötteler, Thomas Beth:
Representation-theoretical properties of the approximate quantum Fourier transform. Appl. Algebra Eng. Commun. Comput. 19(3): 177-193 (2008)- 2006
- [j44]Thomas Beth, Willi Geiselmann, Rainer Steinwandt:
Mathematical Techniques in Cryptology-Editorial. Appl. Algebra Eng. Commun. Comput. 16(6): 377-378 (2006) - [j43]Thomas Beth, Jörn Müller-Quade, Rainer Steinwandt:
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm. J. Symb. Comput. 41(3-4): 372-380 (2006) - 2005
- [j42]Chris Charnes, Thomas Beth:
Combinatorial aspects of jump codes. Discret. Math. 294(1-2): 43-51 (2005) - [j41]Pawel Wocjan, Thomas Beth:
New construction of mutually unbiased bases in square dimensions. Quantum Inf. Comput. 5(2): 93-101 (2005) - [j40]Thomas Beth, Jörn Müller-Quade, Rainer Steinwandt:
Cryptanalysis of a practical quantum key distribution with polarization-entangled photons. Quantum Inf. Comput. 5(3): 181-186 (2005) - [c51]Jörg Moldenhauer, Ingo Boesnach, Thomas Beth, Veit Wank, Klaus Bös:
Analysis of Human Motion for Humanoid Robots. ICRA 2005: 311-316 - 2004
- [c50]Matthias Hahn, Ingo Wuttke, Thomas Beth:
Visualisierung von Halswirbelmobilitäten für die Funktions-Diagnostik. Bildverarbeitung für die Medizin 2004: 214-218 - [c49]Jörg Moldenhauer, Thomas Beth, Ulrich Mende:
Hidden Markov models for the analysis and classification of ultrasound data. CARS 2004: 231-236 - [c48]Matthias Hahn, Thomas Beth:
Balloon Based Vertebra Separation in CT Images. CBMS 2004: 310-315 - [c47]Veit Wank, Andreas Fischer, Klaus Bös, Ingo Boesnach, Jörg Moldenhauer, Thomas Beth:
Similarities and varieties in human motion trajectories of predefined grasping and disposing movements. Humanoids 2004: 311-321 - [c46]Martin Rötteler, Markus Grassl, Thomas Beth:
On quantum MDS codes. ISIT 2004: 355 - 2003
- [j39]Thomas Beth, Chris Charnes, Markus Grassl
, Gernot Alber, Aldo Delgado, Michael Mussinger:
A New Class of Designs Which Protect against Quantum Jumps. Des. Codes Cryptogr. 29(1-3): 51-70 (2003) - [j38]Markus Grassl, Martin Rötteler, Thomas Beth:
Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes. Int. J. Found. Comput. Sci. 14(5): 757-776 (2003) - [j37]Dominik Janzing, Pawel Wocjan, Thomas Beth:
On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs. Int. J. Found. Comput. Sci. 14(5): 889- (2003) - [j36]Thomas Beth:
Gottfried Wolf 23.8.1940 bis 9.1.2003. Inform. Spektrum 26(2): 103-104 (2003) - [j35]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Two QCMA-complete problems. Quantum Inf. Comput. 3(6): 635-643 (2003) - [j34]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing. Quantum Inf. Process. 2(4): 259-270 (2003) - [j33]Dominik Janzing, Thomas Beth:
Quasi-order of clocks and their synchronism and quantum bounds for copying timing information. IEEE Trans. Inf. Theory 49(1): 230-240 (2003) - 2002
- [j32]Chris Charnes, Martin Rötteler, Thomas Beth:
Homogeneous Bent Functions, Invariants, and Designs. Des. Codes Cryptogr. 26(1-3): 139-154 (2002) - [j31]Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt, Thomas Beth:
Über Quantencomputer und Quantenkryptographie. Datenschutz und Datensicherheit 26(8) (2002) - [j30]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity. Quantum Inf. Comput. 2(2): 117-132 (2002) - [j29]Pawel Wocjan, Martin Rötteler, Dominik Janzing, Thomas Beth:
Universal simulation of Hamiltonians using a finite set of control operations. Quantum Inf. Comput. 2(2): 133-150 (2002) - [j28]Dominik Janzing, Thomas Beth:
Quantum algorithm for measuring the eigenvalues of U ⊗ U-1 for a black-box unitary transformation U. Quantum Inf. Comput. 2(3): 192-197 (2002) - [c45]Martin Haimerl, Jörg Moldenhauer, Ulrich Mende, Thomas Beth:
Merkmalsinduzierte Aufbereitung medizinischer Ultraschallbilddaten. Bildverarbeitung für die Medizin 2002: 99-102 - [i2]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Required sample size for learning sparse Bayesian networks with many variables. CoRR cs.LG/0204052 (2002) - 2001
- [j27]Rainer Steinwandt, Dominik Janzing, Thomas Beth:
On using quantum protocols to detect traffic analysis. Quantum Inf. Comput. 1(3): 62-69 (2001) - [c44]Chris Charnes, Martin Rötteler, Thomas Beth:
On Homogeneous Bent Functions. AAECC 2001: 249-259 - [c43]Willi Geiselmann, Rainer Steinwandt, Thomas Beth:
Attacking the Affine Parts of SFLASH. IMACC 2001: 355-359 - [c42]Rainer Steinwandt, Willi Geiselmann, Thomas Beth:
A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH. ISC 2001: 280-293 - [c41]Ingo A. Boesnach, Martin Haimerl, Harmut Friedburg, Thomas Beth:
Compensation of motion artifacts in MR mammography by elastic deformation. Medical Imaging: Image Processing 2001 - [i1]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices. CoRR cs.DM/0112023 (2001) - 2000
- [j26]Thomas Beth, Markus Grassl:
Quantum Computing - Applicable Algebra goes to Physics. Appl. Algebra Eng. Commun. Comput. 10(4/5): 269-272 (2000) - [c40]Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth:
Weaknesses in the SL2(IFs2) Hashing Scheme. CRYPTO 2000: 287-299 - [c39]Thomas Beth:
Quantum computing: an introduction. ISCAS 2000: 735-736
1990 – 1999
- 1999
- [j25]Sebastian Egner, Thomas Beth:
How to Play M13? Des. Codes Cryptogr. 16(3): 243-247 (1999) - [j24]Thomas Beth:
The state of public-key cryptography - not only after the invention of quantum computers. Inf. Secur. Tech. Rep. 4(4): 47-52 (1999) - [c38]Markus Püschel, Martin Rötteler, Thomas Beth:
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups. AAECC 1999: 148-159 - [c37]Markus Grassl, Willi Geiselmann, Thomas Beth:
Quantum Reed-Solomon Codes. AAECC 1999: 231-244 - [c36]Jörn Müller-Quade, Thomas Beth:
Calculating Generators for Invariant Fields of Linear Algebraic Groups. AAECC 1999: 392-403 - [c35]Matthias Hahn, Detlef Zerfowski, Harmut Friedburg, Thomas Beth:
Auswertung von Funtions-CT oberer Halswirbel zur Diagnose von Weichteildistorsionen. Bildverarbeitung für die Medizin 1999: 150-154 - 1998
- [j23]Jörn Müller-Quade, Thomas Beth:
Computing the Intersection of finitely generated fields. SIGSAM Bull. 32(2): 62 (1998) - [j22]Dejan E. Lazic, Hakam Kalouti, Thomas Beth:
Spectra of Long Primitive Binary BCH Codes Cannot Approach the Binomial Distribution. IEEE Trans. Inf. Theory 44(1): 294-295 (1998) - [c34]Andreas Klappenecker, Frank U. May, Thomas Beth:
Filterbankstrukturen zur verlustfreien Kompression medizinischer Bilddaten. Bildverarbeitung für die Medizin 1998 - 1997
- [c33]Sebastian Egner, Markus Püschel, Thomas Beth:
Decomposing a Permutation into a Conjugated Tensor Product. ISSAC 1997: 101-108 - 1996
- [j21]Thomas Beth, Whitfield Diffie:
Special Issue Dedicated to Gustavus J. Simmons - Foreword to this issue. Des. Codes Cryptogr. 7(1-2): 7-9 (1996) - [j20]Thomas Beth:
Watching the Bhang Meter and Flying through Dirt. Des. Codes Cryptogr. 7(1-2): 17-25 (1996) - [j19]Thomas Beth:
Designs, Codes and Crypts - A Puzzle Altogether. Des. Codes Cryptogr. 8(1-2): 91-101 (1996) - 1995
- [c32]Thomas Beth, Hakam Kalouti, Dejan E. Lazic:
Which Families of Long Binary Lianea Codes Have a Binomial Weight Distribution? AAECC 1995: 120-130 - [p1]Thomas Beth, Andreas Klappenecker, Torsten Minkwitz, Armin Nückel:
The ART behind IDEAS. Computer Science Today 1995: 141-158 - 1994
- [j18]Thomas Beth, Fritz Bauspieß, Hans-Joachim Knobloch, Steffen Stempel:
TESS: A security system based on discrete exponentiation. Comput. Commun. 17(7): 466-475 (1994) - [j17]Raphael Yahalom, Birgit Klein, Thomas Beth:
Trust-Based Navigation in Distribution Systems. Comput. Syst. 7(1): 45-73 (1994) - [c31]Thomas Beth:
Multifeature Security through Homomorphic Encryption. ASIACRYPT 1994: 1-17 - [c30]Thomas Beth, Hans-Joachim Knobloch, Marcus Otten, Gustavus J. Simmons, Peer Wichmann:
Towards Acceptable Key Escrow Systems. CCS 1994: 51-58 - [c29]Thomas Beth, Dejan E. Lazic, A. Mathias:
Cryptanalysis of Cryptosystems Based on Remote Chaos Replication. CRYPTO 1994: 318-331 - [c28]Thomas Beth, Malte Borcherding, Birgit Klein:
Valuation of Trust in Open Networks. ESORICS 1994: 3-18 - 1993
- [j16]Dieter Gollmann, Thomas Beth, Frank Damm:
Authentication services in distributed systems. Comput. Secur. 12(8): 753-764 (1993) - [j15]Thomas Beth:
The GF(p)-Dimension of the Codes Generated by the Classical Point-Line Geometries over GP(p). Des. Codes Cryptogr. 3(3): 199-207 (1993) - [j14]Thomas Beth:
Obituary: Fighting for Computer Security - Chris Jahl - in Memoriam. J. Comput. Secur. 2: 3-4 (1993) - [j13]Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone:
Arithmetic Operations in GF(2m). J. Cryptol. 6(1): 3-13 (1993) - [c27]Thomas Beth, Hans-Joachim Knobloch, Marcus Otten:
Verifiable Secret Sharing for Monotone Access Structures. CCS 1993: 189-194 - [c26]Thomas Beth, Cunsheng Ding:
On Almost Perfect Nonlinear Permutations. EUROCRYPT 1993: 65-76 - [c25]Raphael Yahalom, Birgit Klein, Thomas Beth:
Trust relationships in secure systems-a distributed authentication perspective. S&P 1993: 150-164 - 1992
- [b2]Thomas Beth, Markus Frisch, Gustavus J. Simmons:
Public-Key Cryptography: State of the Art and Future Directions, E.I.S.S. Workshop, Oberwolfach, Germany, July 3-6, 1991, Final Report. Lecture Notes in Computer Science 578, Springer 1992, ISBN 3-540-55215-4 [contents] - [j12]Mike Burmester, Yvo Desmedt, Thomas Beth:
Efficient Zero-Knowledge Identification Schemes for Smart Cards. Comput. J. 35(1): 21-29 (1992) - [j11]Thomas Beth, Volker Hatz:
Design Machines: Algebraically Well Described Interconnection Networks. Des. Codes Cryptogr. 2(3): 287-298 (1992) - [c24]Thomas Beth, Volker Hatz, Stephan Teiwes:
Parallelrechnernetzwerke mit zyklischer Topologieumschaltung. ARCS 1992: 177-188 - [c23]Kwok-Yan Lam, Thomas Beth:
Timely Authentication in Distributed Systems. ESORICS 1992: 293-303 - 1991
- [j10]Thomas Beth, Volker Hatz:
A restricted crossbar implementation and its applications. SIGARCH Comput. Archit. News 19(6): 12-16 (1991) - [c22]Thomas Beth, F. Schaefer:
Arithmetic on Non-Supersingular Elliptic Curves. AAECC 1991: 74-81 - [c21]Thomas Beth:
Algebraic System Modelling and Implementation. EUROCAST 1991: 21-31 - [c20]Thomas Beth, F. Schaefer:
Non Supersingular Elliptic Curves for Public Key Cryptosystems. EUROCRYPT 1991: 316-327 - [c19]Thomas Beth, Willi Geiselmann, F. Meyer:
Finding (good) Normal Bases in Finite Fields. ISSAC 1991: 173-178 - [c18]Thomas Beth:
Physik und Informatik. Synergie für Forschung, Lehre und Entwicklung. Physik und Informatik 1991: 65 - [c17]Thomas Beth, Volker Hatz, Stephan Teiwes:
Optisches Rechnen. Physik und Informatik 1991: 122-131 - [c16]Volker Hatz, Thomas Beth:
Transputersysteme für topologieunabhängige Programmierung. Transputer-Anwender-Treffen 1991: 1-8 - 1990
- [j9]Thomas Beth:
Zur Sicherheit der Informationstechnik - Zur Diskussion gestellt. Inform. Spektrum 13(4): 204-215 (1990) - [c15]Thomas Beth, Yvo Desmedt:
Identification Tokens - or: Solving the Chess Grandmaster Problem. CRYPTO 1990: 169-177 - [c14]Thomas Beth, Dejan E. Lazic, Vojin Senk:
A family of binary codes with asymptotically good distance distribution. EUROCODE 1990: 30-41 - [c13]Zong-Duo Dai, Thomas Beth, Dieter Gollmann:
Lower Bounds for the Linear Complexity of Sequences over Residue Rings. EUROCRYPT 1990: 189-195
1980 – 1989
- 1989
- [j8]Thomas Beth, Dieter Gollmann:
Algorithm engineering for public key algorithms. IEEE J. Sel. Areas Commun. 7(4): 458-466 (1989) - [c12]Thomas Beth, Michael Clausen, Dieter Gollmann:
Computer Algebra and Computer Aided Systems Theory. EUROCAST 1989: 161-169 - [c11]Thomas Beth, Zong-Duo Dai:
On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random. EUROCRYPT 1989: 533-543 - [e4]Thomas A. Berson, Thomas Beth:
Local Area Network Security, Workshop LANSEC '89, European Institute for System Security (E.I.S.S.), Karlsruhe, FRG, April 3-6, 1989. Lecture Notes in Computer Science 396, Springer 1989, ISBN 3-540-51754-5 [contents] - 1988
- [c10]Thomas Beth:
Efficient Zero-Knowledge Identification Scheme for Smart Cards. EUROCRYPT 1988: 77-84 - [e3]Thomas Beth, Michael Clausen:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 4th International Conference, AAECC-4, Karlsruhe, FRG, September 23-26, 1986, Proceedings. Lecture Notes in Computer Science 307, Springer 1988, ISBN 3-540-19200-X [contents] - 1987
- [j7]Thomas Beth:
On the Computational Complexity of the General Discrete Fourier Transform. Theor. Comput. Sci. 51: 331-339 (1987) - [c9]Sibylle Mund, Dieter Gollmann, Thomas Beth:
Some Remarks on the Cross Correlation Analysis of Pseudo Random Generators. EUROCRYPT 1987: 25-35 - [c8]Thomas Beth:
Generalized Fourier Transforms. Trends in Computer Algebra 1987: 92-118 - 1986
- [c7]Thomas Beth:
Introduction: Applicable algebra, error-correcting codes, combinatorics and computer algebra. AAECC 1986: 1-4 - [c6]Thomas Beth, B. M. Cook, Dieter Gollmann:
Architectures for Exponentiation in GF(2n). CRYPTO 1986: 302-310 - 1985
- [j6]Thomas Beth:
Generalizing the discrete fourier transform. Discret. Math. 56(2-3): 95-100 (1985) - [c5]Thomas Beth:
On the Arithmetics of Galoisfields and The Like. Algebraic Questions Arising in the Design of Secure Communication Systems. AAECC 1985: 2-16 - [c4]Thomas Beth:
Algebraic and Symbolic Computation in Digital Signal Processing, Coding and Cryptography. European Conference on Computer Algebra (1) 1985: 93-101 - [e2]Thomas Beth, Norbert Cot, Ingemar Ingemarsson:
Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings. Lecture Notes in Computer Science 209, Springer 1985, ISBN 3-540-16076-0 [contents] - 1984
- [c3]Thomas Beth:
Codes, groups and invariants. AAECC 1984: 71-78 - [c2]Thomas Beth, Fred Piper:
The Stop-and-Go Generator. EUROCRYPT 1984: 88-92 - 1983
- [b1]Thomas Beth, Peter Heß, Klaus Wirl:
Kryptographie - eine Einführung in die Methoden und Verfahren der geheimen Nachrichtenübermittlung. Leitfäden der angewandten Informatik, Teubner 1983, ISBN 978-3-519-02465-1, pp. 1-205 - [e1]Thomas Beth:
Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982. Lecture Notes in Computer Science 149, Springer 1983 [contents] - 1982
- [j5]Thomas Beth:
Kryptologie als Instrument des Datenschutzes. Inform. Spektrum 5(2): 82-96 (1982) - [c1]Thomas Beth:
Introduction. EUROCRYPT 1982: 1-30 - 1981
- [j4]Thomas Beth, Norbert Schäfer:
ALGEBRA - An Interactive System for Finite Field Arithmetic. J. Inf. Process. Cybern. 17(2/3): 141-143 (1981) - [j3]Thomas Beth, Gerhard Sagerer:
CODEC - A Program System for the Interactive Development of Error-correcting Coders/Decoders. J. Inf. Process. Cybern. 17(2/3): 145-147 (1981) - [j2]Thomas Beth:
CRC-Codes - Das aktuelle Schlagwort. Inform. Spektrum 4(1): 49-50 (1981)
1970 – 1979
- 1978
- [j1]Thomas Beth, K. S. Vijayan:
Some filing schemes based on finite groups of automorphisms. Computing 20(2): 95-108 (1978)
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-07-12 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
