Martin W. Bunder

Publication Activity (10 Years)

Years Active: 1970-2019
Publications (10 Years): 5

Top Topics

Public Key Cryptosystems

Countermeasures

Top Venues

IACR Cryptol. ePrint Arch.

J. Inf. Secur. Appl.

Publications

Martin W. Bunder
Alternative Solutions to Linear Recurrence Equations. Integers 19 (2019)
Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
Cryptanalysis of RSA-type cryptosystems based on Lucas sequences, Gaussian integers and elliptic curves. J. Inf. Secur. Appl. 40 (2018)
Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
A generalized attack on RSA type cryptosystems. Theor. Comput. Sci. 704 (2017)
Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
A generalized attack on RSA type cryptosystems. IACR Cryptol. ePrint Arch. 2017 (2017)
Martin W. Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
A New Attack on Three Variants of the RSA Cryptosystem. ACISP (2) (2016)
Bruce Bates, Martin W. Bunder, Keith P. Tognetti
Child's addition in the Stern-Brocot tree. Eur. J. Comb. 33 (2) (2012)
Bruce Bates, Martin W. Bunder, Keith P. Tognetti
Locating terms in the Stern-Brocot tree. Eur. J. Comb. 31 (3) (2010)
Bruce Bates, Martin W. Bunder, Keith P. Tognetti
Linking the Calkin-Wilf and Stern-Brocot trees. Eur. J. Comb. 31 (7) (2010)
Martin W. Bunder, R. M. Rizkalla
Proof-finding Algorithms for Classical and Subclassical Propositional Logics. Notre Dame J. Formal Log. 50 (3) (2009)
Martin W. Bunder, Mohua Banerjee, Mihir K. Chakraborty
Some Rough Consequence Logics and their Interrelations. Trans. Rough Sets 8 (2008)
Martin W. Bunder, Wil Dekkers
Are there Hilbert-style Pure Type Systems? Log. Methods Comput. Sci. 4 (1) (2008)
Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler
On binary reflected Gray codes and functions. Discret. Math. 308 (9) (2008)
Martin W. Bunder
The Inhabitation Problem for Intersection Types. CATS (2008)
Martin W. Bunder, Wil Dekkers
Are there Hilbert-style Pure Type Systems? CoRR (2007)
Martin W. Bunder, W. J. M. Dekkers
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic. Notre Dame J. Formal Log. 46 (2) (2005)
Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder
Security Analysis of Michael: The IEEE 802.11i Message Integrity Code. EUC Workshops (2005)
Martin W. Bunder, Jonathan P. Seldin
Variants of the basic calculus of constructions. J. Appl. Log. 2 (2) (2004)
Martin W. Bunder
Intersection types for lambda-terms and combinators and their logics. Log. J. IGPL 10 (4) (2002)
Martin W. Bunder
A Classification of Intersection Type Systems. J. Symb. Log. 67 (1) (2002)
Martin W. Bunder, Keith P. Tognetti
On the self matching properties of [j tau]. Discret. Math. 241 (1-3) (2001)
Martin W. Bunder, Wil Dekkers
Pure Type Systems with More Liberal Rules. J. Symb. Log. 66 (4) (2001)
Martin W. Bunder
Proof finding algorithms for implicational logics. Theor. Comput. Sci. 232 (1-2) (2000)
Martin W. Bunder
Expedited Broda-Damas Bracket Abstraction. J. Symb. Log. 65 (4) (2000)
Wil Dekkers, Martin W. Bunder, Henk Barendregt
Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. J. Symb. Log. 63 (3) (1998)
Wil Dekkers, Martin W. Bunder, Henk Barendregt
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. Arch. Math. Log. 37 (5-6) (1998)
Norman D. Megill, Martin W. Bunder
Weaker D-Complete Logics. Log. J. IGPL 4 (2) (1996)
Martin W. Bunder, J. Roger Hindley
Two beta-Equal lambda-I-Terms with no Types in Common. Theor. Comput. Sci. 155 (1) (1996)
Martin W. Bunder
Lambda Terms Definable as Combinators. Theor. Comput. Sci. 169 (1) (1996)
Martin W. Bunder
A Simplified Form of Condensed Detachment. J. Log. Lang. Inf. 4 (2) (1995)
P. Trigg, J. Roger Hindley, Martin W. Bunder
Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. 135 (2) (1994)
Henk Barendregt, Martin W. Bunder, Wil Dekkers
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. J. Symb. Log. 58 (3) (1993)
Robert K. Meyer, Martin W. Bunder, Lawrence Powers
Implementing the 'Fool's Model' of Combinatory Logic. J. Autom. Reason. 7 (4) (1991)
Martin W. Bunder
Some Improvements to Turner's Algorithm for Bracket Abstraction. J. Symb. Log. 55 (2) (1990)
Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54 (2) (1989)
Martin W. Bunder
Arithmetic based on the Church numerals in illative combinatory logic. Stud Logica 47 (2) (1988)
Martin W. Bunder
Some generalizations to two systems of set theory based on combinatory logic. Arch. Math. Log. 26 (1) (1987)
Martin W. Bunder
Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. J. Symb. Log. 52 (1) (1987)
Martin W. Bunder
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. Theor. Comput. Sci. 41 (1985)
Martin W. Bunder
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. Theor. Comput. Sci. 39 (1985)
Martin W. Bunder
Category theory based on combinatory logic. Arch. Math. Log. 24 (1) (1984)
Martin W. Bunder
A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. J. Symb. Log. 48 (3) (1983)
Martin W. Bunder
Set theory in predicate calculus with equality. Arch. Math. Log. 23 (1) (1983)
Martin W. Bunder
Predicate calculus of arbitrarily high finite order. Arch. Math. Log. 23 (1) (1983)
Martin W. Bunder
A one axiom set theory based on higher order predicate calculus. Arch. Math. Log. 23 (1) (1983)
Martin W. Bunder
Illative combinatory logic without equality as a primitive predicate. Notre Dame J. Formal Log. 23 (1) (1982)
Martin W. Bunder
Some Results in Aczel-Feferman Logic and Set Theory. Math. Log. Q. 28 (19) (1982)
Martin W. Bunder
Predicate calculus and naive set theory in pure combinatory logic. Arch. Math. Log. 21 (1) (1981)
Martin W. Bunder
Significance and illative combinatory logics. Notre Dame J. Formal Log. 21 (2) (1980)
Martin W. Bunder
Deduction theorems in significance logics. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
On the equivalence of systems of rules and systems of axioms in illative combinatory logic. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
Alternative forms of propositional calculus for a given deduction theorem. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
A more relevant relevance logic. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
Generalized restricted generality. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
Λ-elimination in illative combinatory logic. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
Variable binding term operators in λ-calculus. Notre Dame J. Formal Log. 20 (4) (1979)
Martin W. Bunder
Scott's models and illative combinatory logic. Notre Dame J. Formal Log. 20 (3) (1979)
Martin W. Bunder
Equality in. Math. Log. Q. 24 (8) (1978)
Martin W. Bunder, Robert K. Meyer
. J. Symb. Log. 43 (1) (1978)
Martin W. Bunder, Jonathan P. Seldin
Some Anomalies in Fitch's System QD. J. Symb. Log. 43 (2) (1978)
Martin W. Bunder
Consistency Notions in Illative Combinatory Logic. J. Symb. Log. 42 (4) (1977)
Martin W. Bunder
Some notes on: "A deduction theorem for restricted generality". Notre Dame J. Formal Log. 17 (1) (1976)
Martin W. Bunder
. J. Symb. Log. 41 (2) (1976)
Martin W. Bunder
Propositional and predicate calculuses based on combinatory logic. Notre Dame J. Formal Log. 15 (1) (1974)
Martin W. Bunder
Various systems of set theory based on combinatory logic. Notre Dame J. Formal Log. 15 (2) (1974)
Martin W. Bunder
A deduction theorem for restricted generality. Notre Dame J. Formal Log. 14 (3) (1973)
Martin W. Bunder
A generalised Kleene-Rosser paradox for a system containing the combinator K. Notre Dame J. Formal Log. 14 (1) (1973)
Martin W. Bunder
A paradox in illative combinatory logic. Notre Dame J. Formal Log. 11 (4) (1970)