Gregory V. Bard

32 papers A* 1C 3Misc 2Journal 23Unranked 2
YearRankTypeTitle / Venue / Authors
2019 J jnl
Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property.
Theor. Comput. Sci.
Gregory V. Bard
2019 J jnl
The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.
CoRR
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
2019 J jnl
The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.
IEEE Secur. Priv.
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
2015 J jnl
Plaintext recovery for one-time pads used twice.
ACM Commun. Comput. Algebra
Gregory V. Bard, Theodore McDonnough
2012 — conf
Random Permutation Statistics and an Improved Slide-Determine Attack on KeeLoq.
Cryptography and Security
Nicolas T. Courtois, Gregory V. Bard
2012 J jnl
Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers.
Cryptologia
Gregory V. Bard, Shaun Van Ault, Nicolas T. Courtois
2011 J jnl
A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications
CoRR
Nicolas T. Courtois, Gregory V. Bard, Daniel Hulme
2011 J jnl
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements
CoRR
Martin R. Albrecht, Gregory V. Bard, Clément Pernet
2010 J jnl
Abstract only: DEMOCRACY: a heuristic for polynomial systems of equations over finite fields.
ACM Commun. Comput. Algebra
Gregory V. Bard
2010 Misc conf
Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers.
INDOCRYPT
Gregory V. Bard, Nicolas T. Courtois, Jorge Nakahara Jr., Pouyan Sepehrdad, Bingsheng Zhang
2010 J jnl
Algorithm 898: Efficient multiplication of dense matrices over GF(2).
ACM Trans. Math. Softw.
Martin R. Albrecht, Gregory V. Bard, William Hart
2010 Misc conf
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems.
ACISP
Kenneth Koon-Ho Wong, Gregory V. Bard
2010 J jnl
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems.
IACR Cryptol. ePrint Arch.
Kenneth Koon-Ho Wong, Gregory V. Bard
2009 J jnl
Partitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications.
IACR Cryptol. ePrint Arch.
Kenneth Koon-Ho Wong, Gregory V. Bard, Robert H. Lewis
2009 J jnl
Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers.
IACR Cryptol. ePrint Arch.
Nicolas T. Courtois, Gregory V. Bard, Shaun Van Ault
2009 J jnl
The Application of Polynomials over the Field of Two Elements to a Problem in Intellectual Property.
IACR Cryptol. ePrint Arch.
Gregory V. Bard
2008 A* conf
Algebraic and Slide Attacks on KeeLoq.
FSE
Nicolas T. Courtois, Gregory V. Bard, David A. Wagner
2008 J jnl
Efficient Multiplication of Dense Matrices over GF(2)
CoRR
Martin R. Albrecht, Gregory V. Bard, William Hart
2007 C conf
Algebraic Cryptanalysis of the Data Encryption Standard.
IMACC
Nicolas T. Courtois, Gregory V. Bard
2007 J jnl
Algebraic and Slide Attacks on KeeLoq.
IACR Cryptol. ePrint Arch.
Nicolas T. Courtois, Gregory V. Bard, David A. Wagner
2007 — —
Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis.
Gregory V. Bard
2007 C conf
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption.
IMACC
Gregory V. Bard
2007 J jnl
Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers.
IACR Cryptol. ePrint Arch.
Gregory V. Bard, Nicolas T. Courtois, Chris Jefferson
2007 — conf
Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric.
ACSW
Gregory V. Bard
2006 C conf
A Challenging but Feasible Blockwise-Adaptive Chosen-Plaintext Attack on SSL.
SECRYPT
Gregory V. Bard
2006 J jnl
A Challenging but Feasible Blockwise-Adaptive Chosen-Plaintext Attack on SSL.
IACR Cryptol. ePrint Arch.
Gregory V. Bard
2006 J jnl
Accelerating Cryptanalysis with the Method of Four Russians.
IACR Cryptol. ePrint Arch.
Gregory V. Bard
2006 J jnl
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.
Gregory V. Bard
2006 J jnl
Algebraic Cryptanalysis of the Data Encryption Standard.
IACR Cryptol. ePrint Arch.
Nicolas T. Courtois, Gregory V. Bard
2006 J jnl
Modes of Encryption Secure against Blockwise-Adaptive Chosen-Plaintext Attack.
IACR Cryptol. ePrint Arch.
Gregory V. Bard
2006 J jnl
Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric.
IACR Cryptol. ePrint Arch.
Gregory V. Bard
2004 J jnl
The Vulnerability of SSL to Chosen Plaintext Attack.
IACR Cryptol. ePrint Arch.
Gregory V. Bard