default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiam Keliher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[e2]Orr Dunkelman, Liam Keliher:
Selected Areas in Cryptography - SAC 2015 - 22nd International Conference, Sackville, NB, Canada, August 12-14, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9566, Springer 2016, ISBN 978-3-319-31300-9 [contents]- 2015
- [c9]Karen Korstanje, Liam Keliher:
Weak keys and plaintext recovery for the Dhall-Pal Block Cipher. ISCC 2015: 816-821 - 2014
- [c8]Michael Colburn, Liam Keliher:
Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers. INDOCRYPT 2014: 107-123 - 2013
- [c7]Liam Keliher, Anthony Z. Delaney:
Cryptanalysis of the Toorani-Falahati Hill Ciphers. ISCC 2013: 436-440 - [c6]Liam Keliher, Samuel Thibodeau:
Slide Attacks against Iterated Hill Ciphers. SSCC 2013: 179-190 - [i4]Liam Keliher, Anthony Z. Delaney:
Cryptanalysis of the Toorani-Falahati Hill Ciphers. IACR Cryptol. ePrint Arch. 2013: 592 (2013)
2000 – 2009
- 2009
- [c5]Daniel Vogel, Matthew Cudmore, Géry Casiez
, Ravin Balakrishnan, Liam Keliher:
Hand occlusion with tablet-sized direct pen input. CHI 2009: 557-566 - [e1]Roberto Maria Avanzi, Liam Keliher, Francesco Sica:
Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers. Lecture Notes in Computer Science 5381, Springer 2009, ISBN 978-3-642-04158-7 [contents] - 2007
- [j2]Liam Keliher, Jiayuan Sui:
Exact maximum expected differential and linear probability for two-round Advanced Encryption Standard. IET Inf. Secur. 1(2): 53-57 (2007) - [j1]Liam Keliher:
Toward Provable Security Against Differential and Linear Cryptanalysis for Camellia and Related Ciphers. Int. J. Netw. Secur. 5(2): 167-175 (2007) - 2005
- [i3]Liam Keliher, Jiayuan Sui:
Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES). IACR Cryptol. ePrint Arch. 2005: 321 (2005) - 2004
- [c4]Liam Keliher:
Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES. AES Conference 2004: 42-57 - [i2]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptol. ePrint Arch. 2004: 74 (2004) - 2001
- [c3]Liam Keliher, Henk Meijer, Stafford E. Tavares:
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT 2001: 420-436 - [c2]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. Selected Areas in Cryptography 2001: 112-128 - [i1]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. IACR Cryptol. ePrint Arch. 2001: 33 (2001)
1990 – 1999
- 1999
- [c1]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Modeling Linear Characteristics of Substitution-Permutation Networks. Selected Areas in Cryptography 1999: 78-91
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-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
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:
