default search action
Frederik Vercauteren
Person information
- affiliation: Katholieke Universiteit Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i66]Sarah Arpin, Wouter Castryck, Jonathan Komada Eriksen, Gioella Lorenzon, Frederik Vercauteren:
Generalized class group actions on oriented elliptic curves with level structure. IACR Cryptol. ePrint Arch. 2024: 1172 (2024) - [i65]Wouter Castryck, Mingjie Chen, Riccardo Invernizzi, Gioella Lorenzon, Frederik Vercauteren:
Breaking and Repairing SQIsign2D-East. IACR Cryptol. ePrint Arch. 2024: 1453 (2024) - 2023
- [j27]Robin Geelen
, Frederik Vercauteren:
Bootstrapping for BGV and BFV Revisited. J. Cryptol. 36(2): 12 (2023) - [j26]Robin Geelen
BASALISC: Programmable Hardware Accelerator for BGV Fully Homomorphic Encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 32-57 (2023) - [c53]Wouter Castryck
A Polynomial Time Attack on Instances of M-SIDH and FESTA. ASIACRYPT (7) 2023: 127-156 - [c52]Wouter Castryck
Weak Instances of Class Group Action Based Cryptography via Self-pairings. CRYPTO (3) 2023: 762-792 - [c51]Robin Geelen
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. EUROCRYPT (3) 2023: 257-286 - [i64]Wouter Castryck, Marc Houben, Simon-Philipp Merz, Marzio Mula, Sam van Buuren, Frederik Vercauteren:
Weak instances of class group action based cryptography via self-pairings. IACR Cryptol. ePrint Arch. 2023: 549 (2023) - [i63]Wouter Castryck, Frederik Vercauteren:
A polynomial-time attack on instances of M-SIDH and FESTA. IACR Cryptol. ePrint Arch. 2023: 1433 (2023) - 2022
- [j25]Dragos Rotaru
Actively Secure Setup for SPDZ. J. Cryptol. 35(1): 5 (2022) - [j24]Wouter Castryck
Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory: Extended Version. J. Cryptol. 35(4): 24 (2022) - [c50]Wouter Castryck, Thomas Decru, Marc Houben
Horizontal Racewalking Using Radical Isogenies. ASIACRYPT (2) 2022: 67-96 - [i62]Robin Geelen, Michiel Van Beirendonck, Hilder V. L. Pereira, Brian Huffman, Tynan McAuley, Ben Selfridge, Daniel Wagner, Georgios D. Dimou, Ingrid Verbauwhede, Frederik Vercauteren, David W. Archer:
BASALISC: Flexible Asynchronous Hardware Accelerator for Fully Homomorphic Encryption. CoRR abs/2205.14017 (2022) - [i61]Wouter Castryck, Marc Houben, Frederik Vercauteren, Benjamin Wesolowski:
On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves. CoRR abs/2210.01160 (2022) - [i60]Wouter Castryck, Marc Houben, Frederik Vercauteren, Benjamin Wesolowski:
On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves. IACR Cryptol. ePrint Arch. 2022: 345 (2022) - [i59]Robin Geelen, Michiel Van Beirendonck, Hilder V. L. Pereira, Brian Huffman, Tynan McAuley, Ben Selfridge, Daniel Wagner, Georgios D. Dimou, Ingrid Verbauwhede, Frederik Vercauteren, David W. Archer:
BASALISC: Flexible Asynchronous Hardware Accelerator for Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 657 (2022) - [i58]Alan Szepieniec, Frederik Vercauteren:
Lattice-Based Cryptography in Miden VM. IACR Cryptol. ePrint Arch. 2022: 1041 (2022) - [i57]Wouter Castryck, Thomas Decru
Horizontal racewalking using radical isogenies. IACR Cryptol. ePrint Arch. 2022: 1259 (2022) - [i56]Robin Geelen, Frederik Vercauteren:
Bootstrapping for BGV and BFV Revisited. IACR Cryptol. ePrint Arch. 2022: 1363 (2022) - [i55]Robin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 1364 (2022) - 2021
- [c49]Jan-Pieter D'Anvers
Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption. APKC@AsiaCCS 2021: 3-12 - [c48]Eleftheria Makri, Dragos Rotaru, Frederik Vercauteren, Sameer Wagh:
Rabbit: Efficient Comparison for Secure Multi-Party Computation. Financial Cryptography (1) 2021: 249-270 - [c47]Ward Beullens, Lucas Disson, Robi Pedersen
CSI-RAShi: Distributed Key Generation for CSIDH. PQCrypto 2021: 257-276 - [i54]Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren:
Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption. IACR Cryptol. ePrint Arch. 2021: 80 (2021) - [i53]Eleftheria Makri, Dragos Rotaru, Frederik Vercauteren, Sameer Wagh:
Rabbit: Efficient Comparison for Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2021: 119 (2021) - [i52]Carl Bootland, Wouter Castryck, Alan Szepieniec, Frederik Vercauteren:
SoK: On the Security of Cryptographic Problems from Linear Algebra. IACR Cryptol. ePrint Arch. 2021: 1354 (2021) - 2020
- [j23]Carl Bootland, Wouter Castryck
Efficiently Processing Complex-Valued Data in Homomorphic Encryption. J. Math. Cryptol. 14(1): 55-65 (2020) - [j22]Carl Bootland
A framework for cryptographic problems from linear algebra. J. Math. Cryptol. 14(1): 202-217 (2020) - [c46]Wouter Castryck
Radical Isogenies. ASIACRYPT (2) 2020: 493-519 - [c45]Wouter Castryck
Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory. CRYPTO (2) 2020: 92-120 - [c44]Emmanuela Orsini
Overdrive2k: Efficient Secure MPC over $\mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption. CT-RSA 2020: 254-283 - [c43]Wouter Castryck
Rational Isogenies from Irrational Endomorphisms. EUROCRYPT (2) 2020: 523-548 - [i51]Wouter Castryck, Jana Sotáková, Frederik Vercauteren:
Breaking the decisional Diffie-Hellman problem for class group actions using genus theory. IACR Cryptol. ePrint Arch. 2020: 151 (2020) - [i50]Wouter Castryck, Thomas Decru, Frederik Vercauteren:
Radical isogenies. IACR Cryptol. ePrint Arch. 2020: 1108 (2020) - [i49]Ward Beullens, Lucas Disson, Robi Pedersen, Frederik Vercauteren:
CSI-RAShi: Distributed key generation for CSIDH. IACR Cryptol. ePrint Arch. 2020: 1323 (2020)
2010 – 2019
- 2019
- [c42]Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren:
CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations. ASIACRYPT (1) 2019: 227-247 - [c41]Jan-Pieter D'Anvers
Timing Attacks on Error Correcting Codes in Post-Quantum Schemes. TIS@CCS 2019: 2-9 - [c40]Eleftheria Makri, Dragos Rotaru, Nigel P. Smart, Frederik Vercauteren:
EPIC: Efficient Private Image Classification (or: Learning from the Masters). CT-RSA 2019: 473-492 - [c39]Angshuman Karmakar
Pushing the speed limit of constant-time discrete Gaussian sampling. A case study on the Falcon signature scheme. DAC 2019: 88 - [c38]Sujoy Sinha Roy, Furkan Turan
FPGA-Based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data. HPCA 2019: 387-398 - [c37]Jan-Pieter D'Anvers
Decryption Failure Attacks on IND-CCA Secure Lattice-Based Schemes. Public Key Cryptography (2) 2019: 565-598 - [c36]Jan-Pieter D'Anvers
The Impact of Error Dependencies on Ring/Mod-LWE/LWR Based Schemes. PQCrypto 2019: 103-115 - [c35]Thomas Decru, Lorenz Panny, Frederik Vercauteren:
Faster SeaSign Signatures Through Improved Rejection Sampling. PQCrypto 2019: 271-285 - [i48]Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren:
Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2019: 153 (2019) - [i47]Sujoy Sinha Roy, Furkan Turan, Kimmo Järvinen, Frederik Vercauteren, Ingrid Verbauwhede:
FPGA-based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data. IACR Cryptol. ePrint Arch. 2019: 160 (2019) - [i46]Angshuman Karmakar, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede:
Pushing the speed limit of constant-time discrete Gaussian sampling. A case study on Falcon. IACR Cryptol. ePrint Arch. 2019: 267 (2019) - [i45]Carl Bootland, Wouter Castryck, Alan Szepieniec, Frederik Vercauteren:
A Framework for Cryptographic Problems from Linear Algebra. IACR Cryptol. ePrint Arch. 2019: 282 (2019) - [i44]Jan-Pieter D'Anvers, Marcel Tiepelt, Frederik Vercauteren, Ingrid Verbauwhede:
Timing attacks on Error Correcting Codes in Post-Quantum Secure Schemes. IACR Cryptol. ePrint Arch. 2019: 292 (2019) - [i43]Ward Beullens, Thorsten Kleinjung, Frederik Vercauteren:
CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations. IACR Cryptol. ePrint Arch. 2019: 498 (2019) - [i42]Wouter Castryck, Lorenz Panny, Frederik Vercauteren:
Rational isogenies from irrational endomorphisms. IACR Cryptol. ePrint Arch. 2019: 1202 (2019) - [i41]Dragos Rotaru, Nigel P. Smart, Titouan Tanguy, Frederik Vercauteren, Tim Wood:
Actively Secure Setup for SPDZ. IACR Cryptol. ePrint Arch. 2019: 1300 (2019) - 2018
- [j21]Charlotte Bonte
Towards practical privacy-preserving genome-wide association study. BMC Bioinform. 19(1): 537:1-537:12 (2018) - [j20]Steven D. Galbraith
Computational problems in supersingular elliptic curve isogenies. Quantum Inf. Process. 17(10): 265 (2018) - [j19]Angshuman Karmakar
Constant-Time Discrete Gaussian Sampling. IEEE Trans. Computers 67(11): 1561-1571 (2018) - [j18]Sujoy Sinha Roy
HEPCloud: An FPGA-Based Multicore Processor for FV Somewhat Homomorphic Function Evaluation. IEEE Trans. Computers 67(11): 1637-1650 (2018) - [c34]Jan-Pieter D'Anvers
Saber: Module-LWR Based Key Exchange, CPA-Secure Encryption and CCA-Secure KEM. AFRICACRYPT 2018: 282-305 - [c33]Wouter Castryck
Homomorphic SIM ^2 D Operations: Single Instruction Much More Data. EUROCRYPT (1) 2018: 338-359 - [e2]Bart Preneel, Frederik Vercauteren:
Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Leuven, Belgium, July 2-4, 2018, Proceedings. Lecture Notes in Computer Science 10892, Springer 2018, ISBN 978-3-319-93386-3 [contents] - [i40]Steven D. Galbraith, Lorenz Panny, Benjamin Smith
Quantum Equivalence of the DLP and CDHP for Group Actions. CoRR abs/1812.09116 (2018) - [i39]Jan-Pieter D'Anvers, Angshuman Karmakar, Sujoy Sinha Roy, Frederik Vercauteren:
Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. IACR Cryptol. ePrint Arch. 2018: 230 (2018) - [i38]Charlotte Bonte, Frederik Vercauteren:
Privacy-Preserving Logistic Regression Training. IACR Cryptol. ePrint Arch. 2018: 233 (2018) - [i37]Carl Bootland, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Efficiently Processing Complex-Valued Data in Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 785 (2018) - [i36]Carl Bootland, Wouter Castryck, Frederik Vercauteren:
On the Security of the Multivariate Ring Learning with Errors Problem. IACR Cryptol. ePrint Arch. 2018: 966 (2018) - [i35]Jan-Pieter D'Anvers, Frederik Vercauteren, Ingrid Verbauwhede:
On the impact of decryption failures on the security of LWE/LWR based schemes. IACR Cryptol. ePrint Arch. 2018: 1089 (2018) - [i34]Thomas Decru, Lorenz Panny, Frederik Vercauteren:
Faster SeaSign signatures through improved rejection sampling. IACR Cryptol. ePrint Arch. 2018: 1109 (2018) - [i33]Jan-Pieter D'Anvers, Frederik Vercauteren, Ingrid Verbauwhede:
The impact of error dependencies on Ring/Mod-LWE/LWR based schemes. IACR Cryptol. ePrint Arch. 2018: 1172 (2018) - [i32]Steven D. Galbraith, Lorenz Panny, Benjamin Smith, Frederik Vercauteren:
Quantum Equivalence of the DLP and CDHP for Group Actions. IACR Cryptol. ePrint Arch. 2018: 1199 (2018) - 2017
- [j17]Sujoy Sinha Roy, Frederik Vercauteren
Hardware Assisted Fully Homomorphic Function Evaluation and Encrypted Search. IEEE Trans. Computers 66(9): 1562-1572 (2017) - [c32]Joppe W. Bos, Wouter Castryck
Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling. AFRICACRYPT 2017: 184-201 - [c31]Charlotte Bonte, Carl Bootland
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding. CHES 2017: 579-600 - [i31]Charlotte Bonte, Carl Bootland, Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Faster Homomorphic Function Evaluation using Non-Integral Base Encoding. IACR Cryptol. ePrint Arch. 2017: 333 (2017) - [i30]Steven D. Galbraith, Frederik Vercauteren:
Computational problems in supersingular elliptic curve isogenies. IACR Cryptol. ePrint Arch. 2017: 774 (2017) - [i29]Charlotte Bonte, Eleftheria Makri, Amin Ardeshirdavani, Jaak Simm, Yves Moreau, Frederik Vercauteren:
Privacy-Preserving Genome-Wide Association Study is Practical. IACR Cryptol. ePrint Arch. 2017: 955 (2017) - [i28]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Homomorphic SIM2D Operations: Single Instruction Much More Data. IACR Cryptol. ePrint Arch. 2017: 1013 (2017) - [i27]Eleftheria Makri, Dragos Rotaru, Nigel P. Smart, Frederik Vercauteren:
PICS: Private Image Classification with SVM. IACR Cryptol. ePrint Arch. 2017: 1190 (2017) - 2016
- [j16]Oscar Reparaz, Sujoy Sinha Roy, Ruan de Clercq, Frederik Vercauteren
Masking ring-LWE. J. Cryptogr. Eng. 6(2): 139-153 (2016) - [j15]Wouter Castryck
On error distributions in ring-based LWE. LMS J. Comput. Math. 19(A): 130-145 (2016) - [c30]Wouter Castryck
Provably Weak Instances of Ring-LWE Revisited. EUROCRYPT (1) 2016: 147-167 - [c29]Oscar Reparaz, Ruan de Clercq, Sujoy Sinha Roy, Frederik Vercauteren
Additively Homomorphic Ring-LWE Masking. PQCrypto 2016: 233-244 - [c28]Angshuman Karmakar
Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography. WAIFI 2016: 193-207 - [i26]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Provably Weak Instances of Ring-LWE Revisited. IACR Cryptol. ePrint Arch. 2016: 239 (2016) - [i25]Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
On the tightness of the error bound in Ring-LWE. IACR Cryptol. ePrint Arch. 2016: 240 (2016) - [i24]Angshuman Karmakar, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede:
Efficient Finite field multiplication for isogeny based post quantum cryptography. IACR Cryptol. ePrint Arch. 2016: 1046 (2016) - [i23]Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren:
Privacy-friendly Forecasting for the Smart Grid using Homomorphic Encryption and the Group Method of Data Handling. IACR Cryptol. ePrint Arch. 2016: 1117 (2016) - 2015
- [j14]Donald Donglong Chen, Nele Mentens
High-Speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems. IEEE Trans. Circuits Syst. I Regul. Pap. 62-I(1): 157-166 (2015) - [c27]Sujoy Sinha Roy, Kimmo Järvinen, Frederik Vercauteren
Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation. CHES 2015: 164-184 - [c26]Oscar Reparaz, Sujoy Sinha Roy, Frederik Vercauteren
A Masked Ring-LWE Implementation. CHES 2015: 683-702 - [c25]Ruan de Clercq, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede:
Efficient software implementation of ring-LWE encryption. DATE 2015: 339-344 - [i22]Sujoy Sinha Roy, Kimmo Järvinen, Frederik Vercauteren, Vassil S. Dimitrov, Ingrid Verbauwhede:
Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation. IACR Cryptol. ePrint Arch. 2015: 337 (2015) - [i21]Oscar Reparaz, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede:
A masked ring-LWE implementation. IACR Cryptol. ePrint Arch. 2015: 724 (2015) - 2014
- [j13]Nigel P. Smart, Frederik Vercauteren
Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1): 57-81 (2014) - [c24]Sujoy Sinha Roy, Frederik Vercauteren, Nele Mentens
Compact Ring-LWE Cryptoprocessor. CHES 2014: 371-391 - [i20]Sujoy Sinha Roy, Oscar Reparaz, Frederik Vercauteren, Ingrid Verbauwhede:
Compact and Side Channel Secure Discrete Gaussian Sampling. IACR Cryptol. ePrint Arch. 2014: 591 (2014) - [i19]Donald Donglong Chen, Nele Mentens, Frederik Vercauteren, Sujoy Sinha Roy, Ray C. C. Cheung, Derek Chi-Wai Pao, Ingrid Verbauwhede:
High-speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems. IACR Cryptol. ePrint Arch. 2014: 646 (2014) - [i18]Ruan de Clercq, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede:
Efficient Software Implementation of Ring-LWE Encryption. IACR Cryptol. ePrint Arch. 2014: 725 (2014) - 2013
- [c23]Sujoy Sinha Roy, Frederik Vercauteren
High Precision Discrete Gaussian Sampling on FPGAs. Selected Areas in Cryptography 2013: 383-401 - [i17]Sujoy Sinha Roy, Frederik Vercauteren, Nele Mentens, Donald Donglong Chen, Ingrid Verbauwhede:
Compact Hardware Implementation of Ring-LWE Cryptosystems. IACR Cryptol. ePrint Arch. 2013: 866 (2013) - 2012
- [j12]Junfeng Fan, Frederik Vercauteren
Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves. IEEE Trans. Computers 61(5): 676-685 (2012) - [c22]Nikos Mavrogiannopoulos
A cross-protocol attack on the TLS protocol. CCS 2012: 62-72 - [c21]Billy Bob Brumley
Practical Realisation and Elimination of an ECC-Related Software Bug Attack. CT-RSA 2012: 171-186 - [p3]Nadia El Mrabet, Dan Page, Frederik Vercauteren
Fault Attacks on Pairing-Based Cryptography. Fault Analysis in Cryptography 2012: 221-236 - [i16]Junfeng Fan, Frederik Vercauteren:
Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2012: 144 (2012) - 2011
- [j11]Wouter Castryck
Toric forms of elliptic curves and their arithmetic. J. Symb. Comput. 46(8): 943-966 (2011) - [c20]Junfeng Fan, Benedikt Gierlichs, Frederik Vercauteren
To Infinity and Beyond: Combined Attack on ECC Using Points of Low Order. CHES 2011: 143-159 - [c19]Jens Hermans, Andreas Pashalidis, Frederik Vercauteren
A New RFID Privacy Model. ESORICS 2011: 568-587 - [c18]Jake Loftus, Alexander May
On CCA-Secure Somewhat Homomorphic Encryption. Selected Areas in Cryptography 2011: 55-72 - [i15]Nigel P. Smart, Frederik Vercauteren:
Fully Homomorphic SIMD Operations. IACR Cryptol. ePrint Arch. 2011: 133 (2011) - [i14]Billy Bob Brumley, Manuel Barbosa, Dan Page, Frederik Vercauteren:
Practical realisation and elimination of an ECC-related software bug attack. IACR Cryptol. ePrint Arch. 2011: 633 (2011) - 2010
- [j10]Miroslav Knezevic, Frederik Vercauteren
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods. IEEE Trans. Computers 59(12): 1715-1721 (2010) - [j9]Frederik Vercauteren
Optimal pairings. IEEE Trans. Inf. Theory 56(1): 455-461 (2010) - [c17]Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren
Parallel Shortest Lattice Vector Enumeration on Graphics Cards. AFRICACRYPT 2010: 52-68 - [c16]Jens Hermans, Frederik Vercauteren
Speed Records for NTRU. CT-RSA 2010: 73-88 - [c15]Nigel P. Smart, Frederik Vercauteren
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. Public Key Cryptography 2010: 420-443 - [c14]Junfeng Fan, Jens Hermans, Frederik Vercauteren
On the Claimed Privacy of EC-RAC III. RFIDSec 2010: 66-74 - [c13]Miroslav Knezevic, Frederik Vercauteren
Speeding Up Bipartite Modular Multiplication. WAIFI 2010: 166-179 - [i13]Junfeng Fan, Jens Hermans, Frederik Vercauteren:
On the claimed privacy of EC-RAC III. IACR Cryptol. ePrint Arch. 2010: 132 (2010) - [i12]Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren:
On CCA-Secure Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010: 560 (2010)
2000 – 2009
- 2009
- [j8]Joan Daemen, Mario Lamberger, Norbert Pramstaller, Vincent Rijmen
Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers. Computing 85(1-2): 85-104 (2009) - [c12]Junfeng Fan, Frederik Vercauteren
Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves. CHES 2009: 240-253 - [p2]Frederik Vercauteren
Pairings on Elliptic Curves. Identity-Based Cryptography 2009: 13-30 - [p1]Claire Whelan, Dan Page, Frederik Vercauteren
Implementation Attacks & Countermeasures. Identity-Based Cryptography 2009: 226-243 - [i11]Nigel P. Smart, Frederik Vercauteren:
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. IACR Cryptol. ePrint Arch. 2009: 571 (2009) - [i10]Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel:
Parallel Shortest Lattice Vector Enumeration on Graphics Cards. IACR Cryptol. ePrint Arch. 2009: 601 (2009) - 2008
- [j7]Steven D. Galbraith
Aspects of Pairing Inversion. IEEE Trans. Inf. Theory 54(12): 5719-5728 (2008) - [c11]Wouter Castryck
Computing Zeta Functions in Families of Ca, b. ANTS 2008: 296-311 - [c10]Frederik Vercauteren
The Hidden Root Problem. Pairing 2008: 89-99 - [i9]Frederik Vercauteren:
Optimal Pairings. IACR Cryptol. ePrint Arch. 2008: 96 (2008) - [i8]Frederik Vercauteren:
The Hidden Root Problem. IACR Cryptol. ePrint Arch. 2008: 261 (2008) - 2007
- [j6]Nigel P. Smart, Frederik Vercauteren
On computable isomorphisms in efficient asymmetric pairing-based systems. Discret. Appl. Math. 155(4): 538-547 (2007) - [c9]Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren:
Ate Pairing on Hyperelliptic Curves. EUROCRYPT 2007: 430-447 - [c8]Steven D. Galbraith
Hyperelliptic Pairings. Pairing 2007: 108-131 - [i7]Steven D. Galbraith, Florian Hess, Frederik Vercauteren:
Aspects of Pairing Inversion. IACR Cryptol. ePrint Arch. 2007: 256 (2007) - 2006
- [j5]Jan Denef, Frederik Vercauteren
Counting points on Cab curves using Monsky-Washnitzer cohomology. Finite Fields Their Appl. 12(1): 78-102 (2006) - [j4]Jan Denef, Frederik Vercauteren
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2. J. Cryptol. 19(1): 1-25 (2006) - [j3]Dan Page, Frederik Vercauteren
A Fault Attack on Pairing-Based Cryptography. IEEE Trans. Computers 55(9): 1075-1080 (2006) - [j2]Florian Hess, Nigel P. Smart, Frederik Vercauteren
The Eta Pairing Revisited. IEEE Trans. Inf. Theory 52(10): 4595-4602 (2006) - [c7]Antoine Joux
The Number Field Sieve in the Medium Prime Case. CRYPTO 2006: 326-344 - [i6]Florian Hess, Nigel P. Smart, Frederik Vercauteren:
The Eta Pairing Revisited. IACR Cryptol. ePrint Arch. 2006: 110 (2006) - [i5]Wouter Castryck, Jan Denef, Frederik Vercauteren:
Computing Zeta Functions of Nondegenerate Curves. IACR Cryptol. ePrint Arch. 2006: 240 (2006) - 2005
- [c6]Robert Granger, Frederik Vercauteren:
On the Discrete Logarithm Problem on Algebraic Tori. CRYPTO 2005: 66-85 - [e1]Henri Cohen, Gerhard Frey, Roberto Avanzi, Christophe Doche, Tanja Lange, Kim Nguyen, Frederik Vercauteren:
Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall/CRC 2005, ISBN 978-1-58488-518-4 [contents] - [r3]David Lubicz, Frederik Vercauteren:
Cohomological Background on Point Counting. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 133-141 - [r2]Frederik Vercauteren:
Arithmetic of p-adic Numbers. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 239-263 - [r1]Reynald Lercier, David Lubicz, Frederik Vercauteren:
Point Counting on Elliptic and Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 406-453 - [i4]Nigel P. Smart, Frederik Vercauteren:
On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems. IACR Cryptol. ePrint Arch. 2005: 116 (2005) - 2004
- [j1]A. Muzereau, Nigel P. Smart, Frederik Vercauteren:
The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications. LMS J. Comput. Math. 7: 50-72 (2004) - [c5]Robert Granger, Andrew J. Holt, Dan Page, Nigel P. Smart, Frederik Vercauteren:
Function Field Sieve in Characteristic Three. ANTS 2004: 223-234 - [c4]Joseph H. Silverman, Nigel P. Smart, Frederik Vercauteren:
An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations. SCN 2004: 278-293 - [i3]Dan Page, Nigel P. Smart, Frederik Vercauteren:
A comparison of MNT curves and supersingular curves. IACR Cryptol. ePrint Arch. 2004: 165 (2004) - [i2]Dan Page, Frederik Vercauteren:
Fault and Side-Channel Attacks on Pairing Based Cryptography. IACR Cryptol. ePrint Arch. 2004: 283 (2004) - 2002
- [c3]Jan Denef, Frederik Vercauteren
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2. ANTS 2002: 308-323 - [c2]Frederik Vercauteren:
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2. CRYPTO 2002: 369-384 - [i1]Jan Denef, Frederik Vercauteren:
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2. IACR Cryptol. ePrint Arch. 2002: 105 (2002) - 2001
- [c1]Frederik Vercauteren, Bart Preneel, Joos Vandewalle:
A Memory Efficient Version of Satoh's Algorithm. EUROCRYPT 2001: 1-13
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-10-07 22:07 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: