default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregory V. Bard
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Alan T. Sherman
, Josiah Dykstra, Gregory V. Bard, Ankur Chattopadhyay, Filipo Sharevski, Rakesh M. Verma, Ryan Vrecenar, Linda Oliva, Enis Golaszewski, Dhananjay S. Phatak, Travis Scheponik, Geoffrey L. Herman, Dong San Choi, Spencer E. Offenberger, Peter Peterson:
The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories. IEEE Secur. Priv. 17(6): 77-83 (2019)- [j5]Gregory V. Bard:
Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property. Theor. Comput. Sci. 800: 3-14 (2019) - [i18]Alan T. Sherman, Linda Oliva, Enis Golaszewski, Dhananjay S. Phatak, Travis Scheponik, Geoffrey L. Herman, Dong San Choi, Spencer E. Offenberger, Peter Peterson, Josiah Dykstra, Gregory V. Bard, Ankur Chattopadhyay, Filipo Sharevski, Rakesh M. Verma, Ryan Vrecenar:
The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories. CoRR abs/1901.09286 (2019) - 2015
- [j4]Gregory V. Bard, Theodore McDonnough:
Plaintext recovery for one-time pads used twice. ACM Commun. Comput. Algebra 49(1): 17-18 (2015) - 2012
- [j3]Gregory V. Bard, Shaun Van Ault, Nicolas T. Courtois:
Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers. Cryptologia 36(3): 240-262 (2012) - [c9]Nicolas T. Courtois, Gregory V. Bard:
Random Permutation Statistics and an Improved Slide-Determine Attack on KeeLoq. Cryptography and Security 2012: 35-54 - [i17]Gregory Bard, Alexander Basyrov:
Error Bounds on Derivatives during Simulations. CoRR abs/1212.0280 (2012) - 2011
- [c8]Michael Black, Gregory Bard:
SAT Over BOINC: An Application-Independent Volunteer Grid Project. GRID 2011: 226-227 - [i16]Nicolas T. Courtois, Gregory V. Bard, Daniel Hulme:
A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications. CoRR abs/1108.2830 (2011) - [i15]Martin R. Albrecht, Gregory V. Bard, Clément Pernet:
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements. CoRR abs/1111.6549 (2011) - 2010
- [j2]Gregory V. Bard:
Abstract only: DEMOCRACY: a heuristic for polynomial systems of equations over finite fields. ACM Commun. Comput. Algebra 44(1/2): 25 (2010) - [j1]Martin R. Albrecht, Gregory V. Bard, William Hart:
Algorithm 898: Efficient multiplication of dense matrices over GF(2). ACM Trans. Math. Softw. 37(1): 9:1-9:14 (2010) - [c7]Kenneth Koon-Ho Wong, Gregory V. Bard:
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems. ACISP 2010: 19-36 - [c6]Gregory V. Bard, Nicolas T. Courtois, Jorge Nakahara Jr., Pouyan Sepehrdad, Bingsheng Zhang:
Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers. INDOCRYPT 2010: 176-196 - [i14]Kenneth Koon-Ho Wong, Gregory V. Bard:
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems. IACR Cryptol. ePrint Arch. 2010: 349 (2010)
2000 – 2009
- 2009
- [i13]Nicolas T. Courtois, Gregory V. Bard, Shaun Van Ault:
Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers. IACR Cryptol. ePrint Arch. 2009: 186 (2009) - [i12]Gregory V. Bard:
The Application of Polynomials over the Field of Two Elements to a Problem in Intellectual Property. IACR Cryptol. ePrint Arch. 2009: 326 (2009) - [i11]Kenneth Koon-Ho Wong, Gregory V. Bard, Robert H. Lewis:
Partitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications. IACR Cryptol. ePrint Arch. 2009: 343 (2009) - 2008
- [c5]Nicolas T. Courtois, Gregory V. Bard, David A. Wagner:
Algebraic and Slide Attacks on KeeLoq. FSE 2008: 97-115 - [i10]Martin R. Albrecht, Gregory V. Bard, William Hart:
Efficient Multiplication of Dense Matrices over GF(2). CoRR abs/0811.1714 (2008) - 2007
- [b1]Gregory V. Bard:
Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis. University of Maryland, College Park, MD, USA, 2007 - [c4]Gregory V. Bard:
Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric. ACSW 2007: 117-124 - [c3]Gregory V. Bard:
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption. IMACC 2007: 129-151 - [c2]Nicolas T. Courtois, Gregory V. Bard:
Algebraic Cryptanalysis of the Data Encryption Standard. IMACC 2007: 152-169 - [i9]Gregory V. Bard, Nicolas T. Courtois, Chris Jefferson:
Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers. IACR Cryptol. ePrint Arch. 2007: 24 (2007) - [i8]Nicolas T. Courtois, Gregory V. Bard, David A. Wagner:
Algebraic and Slide Attacks on KeeLoq. IACR Cryptol. ePrint Arch. 2007: 62 (2007) - 2006
- [c1]Gregory V. Bard:
A Challenging but Feasible Blockwise-Adaptive Chosen-Plaintext Attack on SSL. SECRYPT 2006: 99-109 - [i7]Gregory V. Bard:
A Challenging but Feasible Blockwise-Adaptive Chosen-Plaintext Attack on SSL. IACR Cryptol. ePrint Arch. 2006: 136 (2006) - [i6]Gregory V. Bard:
Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods. IACR Cryptol. ePrint Arch. 2006: 163 (2006) - [i5]Gregory V. Bard:
Accelerating Cryptanalysis with the Method of Four Russians. IACR Cryptol. ePrint Arch. 2006: 251 (2006) - [i4]Gregory V. Bard:
Modes of Encryption Secure against Blockwise-Adaptive Chosen-Plaintext Attack. IACR Cryptol. ePrint Arch. 2006: 271 (2006) - [i3]Gregory V. Bard:
Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric. IACR Cryptol. ePrint Arch. 2006: 364 (2006) - [i2]Nicolas T. Courtois, Gregory V. Bard:
Algebraic Cryptanalysis of the Data Encryption Standard. IACR Cryptol. ePrint Arch. 2006: 402 (2006) - 2004
- [i1]Gregory V. Bard:
The Vulnerability of SSL to Chosen Plaintext Attack. IACR Cryptol. ePrint Arch. 2004: 111 (2004)
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-08-05 21:21 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:
