Skip header Section
Skip Bibliometrics Section
A course in computational algebraic number theoryFebruary 1995
- Author:
- Henri Cohen
Abstract
No abstract available.
Cited By
- Chen M, Imran M, Ivanyos G, Kutas P, Leroux A and Petit C Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH Advances in Cryptology – ASIACRYPT 2023, (99-130)
- Pellet-Mary A and Stehlé D On the Hardness of the NTRU Problem Advances in Cryptology – ASIACRYPT 2021, (3-35)
Johansson F Calcium Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation, (225-232)- Elsenhans A and Jahnel J Computations with Algebraic Surfaces Mathematical Software – ICMS 2020, (87-93)
- Li J and Nguyen P Computing a Lattice Basis Revisited Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, (275-282)
- Liu R and Pan Y Computing Hermite Normal Form Faster via Solving System of Linear Equations Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, (283-290)
- Li Z, Li M, Shi C, Fan L, Liu Y, Song W, Tang W and Zou X (2019). Impact of ambiguity resolution with sequential constraints on real-time precise GPS satellite orbit determination, GPS Solutions, 23:3, (1-14), Online publication date: 1-Jul-2019.
- Hoagland C, Humphries S, Nicholson N and Poulsen S (2019). Difference Sets Disjoint from a Subgroup, Graphs and Combinatorics, 35:3, (579-597), Online publication date: 1-May-2019.
- An X, Meng X, Chen H, Jiang W, Xi R, Chen Q and Zhou X (2019). Improving integrated precise orbit determination of GPS, GLONASS, BDS and Galileo through integer ambiguity resolution, GPS Solutions, 23:2, (1-15), Online publication date: 1-Apr-2019.
- Barthe G, Fagerholm E, Fiore D, Mitchell J, Scedrov A and Schmidt B (2019). Automated Analysis of Cryptographic Assumptions in Generic Group Models, Journal of Cryptology, 32:2, (324-360), Online publication date: 1-Apr-2019.
- Brakensiek J and Guruswami V An algorithmic blend of LPs and ring equations for promise CSPs Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (436-455)
- del Pino R, Lyubashevsky V and Seiler G Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (574-591)
- Nagashima H and Shirayanagi K (2018). Effect of the interval-symbol method with correct zero rewriting on the δ-LLL algorithm, ACM Communications in Computer Algebra, 52:2, (24-31), Online publication date: 1-Oct-2018.
- Augot D, Loidreau P and Robert G (2018). Generalized Gabidulin codes over fields of any characteristic, Designs, Codes and Cryptography, 86:8, (1807-1848), Online publication date: 1-Aug-2018.
- Gharibian S and Sikora J (2018). Ground State Connectivity of Local Hamiltonians, ACM Transactions on Computation Theory, 10:2, (1-28), Online publication date: 23-May-2018.
- Mérai L (2018). On the elliptic curve endomorphism generator, Designs, Codes and Cryptography, 86:5, (1113-1129), Online publication date: 1-May-2018.
- Velez J, Hernandez J and Cadavid C (2017). Limits of quotients of polynomial functions in three variables, ACM Communications in Computer Algebra, 51:2, (42-56), Online publication date: 10-Oct-2017.
- Pei S and Chang K (2017). Two-Dimensional Period Estimation by Ramanujan's Sum, IEEE Transactions on Signal Processing, 65:19, (5108-5120), Online publication date: 1-Oct-2017.
- Paolini G (2017). An Algorithm for Canonical Forms of Finite Subsets of $$\mathbb {Z}^d$$Zd up to Affinities, Discrete & Computational Geometry, 58:2, (293-312), Online publication date: 1-Sep-2017.
- Nayyeri M, Maskooki A and Monsefi R (2017). A New Sparse Learning Machine, Neural Processing Letters, 46:1, (15-28), Online publication date: 1-Aug-2017.
- Sircana C Factorization of Polynomials over Z/(pn) Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, (405-412)
- de Boer K and Pagano C Calculating the Power Residue Symbol and Ibeta Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, (117-124)
- Fieker C, Hart W, Hofmann T and Johansson F Nemo/Hecke Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, (157-164)
- Fan X, Otemissov A, Sica F and Sidorenko A (2017). Multiple point compression on elliptic curves, Designs, Codes and Cryptography, 83:3, (565-588), Online publication date: 1-Jun-2017.
- Chen T and Mehta D (2017). Parallel degree computation for binomial systems, Journal of Symbolic Computation, 79:P3, (535-558), Online publication date: 1-Mar-2017.
- Elsenhans A (2017). Improved methods for the construction of relative invariants for permutation groups, Journal of Symbolic Computation, 79:P2, (211-231), Online publication date: 1-Mar-2017.
- Law M and Monagan M (2017). Computing characteristic polynomials of matrices of structured polynomials, ACM Communications in Computer Algebra, 50:4, (182-184), Online publication date: 22-Feb-2017.
- Bonchi F, Sobociński P and Zanasi F (2017). The Calculus of Signal Flow Diagrams I, Information and Computation, 252:C, (2-29), Online publication date: 1-Feb-2017.
- Harn L, Hsu C, Zhang M, He T and Zhang M (2016). Realizing secret sharing with general access structure, Information Sciences: an International Journal, 367:C, (209-220), Online publication date: 1-Nov-2016.
- Akhlaq A, McKilliam R, Subramanian R and Pollok A (2016). Selecting Wavelengths for Least Squares Range Estimation, IEEE Transactions on Signal Processing, 64:20, (5205-5216), Online publication date: 15-Oct-2016.
- Chonev V, Ouaknine J and Worrell J (2016). On the Complexity of the Orbit Problem, Journal of the ACM, 63:3, (1-18), Online publication date: 1-Sep-2016.
- Chonev V, Ouaknine J and Worrell J On Recurrent Reachability for Continuous Linear Dynamical Systems Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (515-524)
- Ouaknine J, Pouly A, Sousa-Pinto J and Worrell J Solvability of Matrix-Exponential Equations Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (798-806)
- de Beaudrap N and Gharibian S A linear time algorithm for quantum 2-SAT Proceedings of the 31st Conference on Computational Complexity, (1-21)
- Tagliasacchi M, Visentini-Scarzanella M, Dragotti P and Tubaro S (2016). Identification of Transform Coding Chains, IEEE Transactions on Image Processing, 25:3, (1109-1123), Online publication date: 1-Mar-2016.
- Biasse J and Song F Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (893-902)
- Barki H, Fang L, Michelucci D and Foufou S (2016). Re-parameterization reduces irreducible geometric constraint systems, Computer-Aided Design, 70:C, (182-192), Online publication date: 1-Jan-2016.
- Dwivedi S Computing Modular Exponentiation for Fixed-Exponent Proceedings of the 8th Annual ACM India Conference, (89-94)
- Elashry I, Mu Y and Susilo W (2015). A resilient identity-based authenticated key exchange protocol, Security and Communication Networks, 8:13, (2279-2290), Online publication date: 10-Sep-2015.
- Lechner A, Ouaknine J and Worrell J On the Complexity of Linear Arithmetic with Divisibility Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (667-676)
- Kauers M and Koutschan C Integral D-Finite Functions Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, (251-258)
- Bermejo I and García-Marco I (2015). Complete intersections in simplicial toric varieties, Journal of Symbolic Computation, 68:P1, (265-286), Online publication date: 1-May-2015.
- Li W, Yuan C and Gao X (2015). Sparse difference resultant, Journal of Symbolic Computation, 68:P1, (169-203), Online publication date: 1-May-2015.
- Gupta K and Ray I (2015). Finding Biaffine and Quadratic Equations for S-Boxes Based on Power Mappings, IEEE Transactions on Information Theory, 61:4, (2200-2209), Online publication date: 1-Apr-2015.
- Ouaknine J, Pinto J and Worrell J On termination of integer linear loops Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (957-969)
- Chonev V, Ouaknine J and Worrell J The polyhedron-hitting problem Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (940-956)
- Marušic I and Worrell J (2015). Complexity of equivalence and learning for multiplicity tree automata, The Journal of Machine Learning Research, 16:1, (2465-2500), Online publication date: 1-Jan-2015.
- Xiao L, Liu S and Yang D (2015). A low-complexity block diagonalization algorithm for MU-MIMO two-way relay systems with complex lattice reduction, International Journal of Distributed Sensor Networks, 2015, (120-120), Online publication date: 1-Jan-2015.
- Coxon N (2014). List decoding of number field codes, Designs, Codes and Cryptography, 72:3, (687-711), Online publication date: 1-Sep-2014.
- Saruchi , Morel I, Stehlé D and Villard G LLL reducing with the most significant bits Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, (367-374)
- Eisenträger K, Hallgren S, Kitaev A and Song F A quantum algorithm for computing the unit group of an arbitrary degree number field Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (293-302)
- Gethner E, Kirkpatrick D and Pippenger N (2014). Computational Aspects of M.C. Escher's Ribbon Patterns, Theory of Computing Systems, 54:4, (640-658), Online publication date: 1-May-2014.
- Bi J, Coron J, Faugère J, Nguyen P, Renault G and Zeitoun R Rounding and Chaining LLL Proceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 8383, (185-202)
- Hsu C and Lin Y (2014). Improved migration for mobile computing in distributed networks, Computer Standards & Interfaces, 36:3, (577-584), Online publication date: 1-Mar-2014.
- Haviv I and Regev O On the lattice isomorphism problem Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (391-404)
- Ouaknine J and Worrell J Positivity problems for low-order linear recurrence sequences Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (366-379)
- Lee C, Lai Y and Hsiao C (2013). Cryptanalysis of a simple key assignment for access control based on polynomial, Journal of Information Security and Applications, 18:4, (215-218), Online publication date: 1-Dec-2013.
- Lyubashevsky V, Peikert C and Regev O (2013). On Ideal Lattices and Learning with Errors over Rings, Journal of the ACM, 60:6, (1-35), Online publication date: 1-Nov-2013.
- Hubert E and Labahn G (2013). Scaling Invariants and Symmetry Reduction of Dynamical Systems, Foundations of Computational Mathematics, 13:4, (479-516), Online publication date: 1-Aug-2013.
- Chonev V, Ouaknine J and Worrell J The orbit problem in higher dimensions Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, (941-950)
- Cheng Q and Zhuang J (2013). On certain computations of Pisot numbers, Information Processing Letters, 113:8, (271-275), Online publication date: 1-Apr-2013.
- Morán Ramírez D and Dey S A polynomial-time algorithm to check closedness of simple second order mixed-integer sets Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization, (266-277)
- Longa P and Sica F Four-Dimensional gallant-lambert-vanstone scalar multiplication Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (718-739)
- Ouaknine J and Worrell J Decision problems for linear recurrence sequences Proceedings of the 6th international conference on Reachability Problems, (21-28)
- Hubert E and Labahn G Rational invariants of scalings from Hermite normal forms Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, (219-226)
- Biasse J and Fieker C A polynomial time algorithm for computing the HNF of a module over the integers of a number field Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, (75-82)
- Nitaj A A new attack on RSA and CRT-RSA Proceedings of the 5th international conference on Cryptology in Africa, (221-233)
- Arvind V and Kurur P (2012). Testing nilpotence of galois groups in polynomial time, ACM Transactions on Algorithms, 8:3, (1-22), Online publication date: 1-Jul-2012.
- Feng T and Xiang Q (2012). Strongly regular graphs from unions of cyclotomic classes, Journal of Combinatorial Theory Series B, 102:4, (982-995), Online publication date: 1-Jul-2012.
- Wang P and Zhang F (2012). Computing elliptic curve discrete logarithms with the negation map, Information Sciences: an International Journal, 195, (277-286), Online publication date: 1-Jul-2012.
- Jovanović D and de Moura L Solving non-linear arithmetic Proceedings of the 6th international joint conference on Automated Reasoning, (339-354)
- Gethner E, Kirkpatrick D and Pippenger N M.C. escher wrap artist Proceedings of the 6th international conference on Fun with Algorithms, (198-209)
- Lobachev O Parallel computation skeletons with premature termination property Proceedings of the 11th international conference on Functional and Logic Programming, (197-212)
- Kuncak V, Mayer M, Piskac R and Suter P (2012). Software synthesis procedures, Communications of the ACM, 55:2, (103-111), Online publication date: 1-Feb-2012.
- Berzati A, Canovas-Dumas C and Goubin L Secret key leakage from public key perturbation of DLP-Based cryptosystems Cryptography and Security, (233-247)
- Gupta S and Storjohann A Computing hermite forms of polynomial matrices Proceedings of the 36th international symposium on Symbolic and algebraic computation, (155-162)
- Hayasaka K and Takagi T An experiment of number field sieve over GF(p) of low hamming weight characteristic Proceedings of the Third international conference on Coding and cryptology, (191-200)
- Rose M, Plantard T and Susilo W Improving BDD cryptosystems in general lattices Proceedings of the 7th international conference on Information security practice and experience, (152-167)
- Manulis M and Poettering B Practical affiliation-hiding authentication from improved polynomial interpolation Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, (286-295)
- Wang X, Liu M, Tian C and Bi J Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, (1-9)
- Cook W and Steffy D (2011). Solving Very Sparse Rational Systems of Equations, ACM Transactions on Mathematical Software, 37:4, (1-21), Online publication date: 1-Feb-2011.
- Hu Z, Xu M and Zhou Z A generalization of Verheul's theorem for some ordinary curves Proceedings of the 6th international conference on Information security and cryptology, (105-114)
- Yu J, Yap C, Du Z, Pion S and Brönnimann H The design of core 2 Proceedings of the Third international congress conference on Mathematical software, (121-141)
- Plantard T and Susilo W Recursive lattice reduction Proceedings of the 7th international conference on Security and cryptography for networks, (329-344)
- Avendaño M, Ibrahim A, Rojas J and Rusek K Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, (331-338)
- Lyubashevsky V, Peikert C and Regev O On ideal lattices and learning with errors over rings Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (1-23)
- Maitra S, Sarkar S and Sen Gupta S Factoring RSA modulus using prime reconstruction from random known bits Proceedings of the Third international conference on Cryptology in Africa, (82-99)
- Joye M, Naccache D and Porte S The polynomial composition problem in (Z/nZ)[X] Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application, (1-12)
- Wagstaff S Computational number theory Algorithms and theory of computation handbook, (16-16)
- Eisenträger K and Hallgren S Algorithms for ray class groups and Hilbert class fields Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (471-483)
- Bhattacharyya A and Xie N Lower bounds for testing triangle-freeness in Boolean functions Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (87-98)
- Sakemi Y, Takeuchi S, Nogami Y and Morikawa Y Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing Proceedings of the 12th international conference on Information security and cryptology, (47-64)
- Castagnos G, Joux A, Laguillaumie F and Nguyen P Factoring pq2 with Quadratic Forms Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (469-486)
- Backes W and Wetzel S Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm Proceedings of the 15th International Euro-Par Conference on Parallel Processing, (960-973)
- Yap C Exact numerical computation in algebra and geometry Proceedings of the 2009 international symposium on Symbolic and algebraic computation, (387-388)
- Morel I, Stehlé D and Villard G H-LLL Proceedings of the 2009 international symposium on Symbolic and algebraic computation, (271-278)
- Brownawell W and Yap C Lower bounds for zero-dimensional projections Proceedings of the 2009 international symposium on Symbolic and algebraic computation, (79-86)
- Gan Y, Ling C and Mow W (2009). Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection, IEEE Transactions on Signal Processing, 57:7, (2701-2710), Online publication date: 1-Jul-2009.
- Lory P Reducing the Complexity in the Distributed Computation of Private RSA Keys Proceedings of the 14th Australasian Conference on Information Security and Privacy, (250-263)
- Joye M and Tunstall M Exponent Recoding and Regular Exponentiation Algorithms Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology, (334-349)
- Jhanwar M and Barua R A Variant of Boneh-Gentry-Hamburg's Pairing-Free Identity Based Encryption Scheme Information Security and Cryptology, (314-331)
- Berzati A, Canovas C, Dumas J and Goubin L Fault Attacks on RSA Public Keys Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology, (414-428)
- Junod P, Karlov A and Lenstra A Improving the Boneh-Franklin Traitor Tracing Scheme Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09, (88-104)
- Morel I, Stehlé D and Villard G (2009). From an LLL-reduced basis to another, ACM Communications in Computer Algebra, 42:3, (142-143), Online publication date: 6-Feb-2009.
- Pujol X and Stehlé D Rigorous and Efficient Short Lattice Vectors Enumeration Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (390-405)
- Grześkowiak M On Generating Elements of Orders Dividing p2k±pk + 1 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security, (1-19)
- Grześkowiak M Generating a Large Prime Factor of p4 ± p2 + 1 in Polynomial Time Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems, (1140-1149)
- Kauers M and Zimmermann B (2008). Computing the algebraic relations of C-finite sequences and multisequences, Journal of Symbolic Computation, 43:11, (787-803), Online publication date: 1-Nov-2008.
- Kredel H Unique factorization domains in the java computer algebra system Proceedings of the 7th international conference on Automated deduction in geometry, (86-115)
- Bröker R, Charles D and Lauter K Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography Proceedings of the 2nd international conference on Pairing-Based Cryptography, (100-112)
- Poteaux A and Rybowicz M Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, (239-246)
- Negre C and Plantard T Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation Proceedings of the 13th Australasian conference on Information Security and Privacy, (463-477)
- Zhu J, Li X, Ye Y and Wang G (2008). Analysis on the strip-based projection model for discrete tomography, Discrete Applied Mathematics, 156:12, (2359-2367), Online publication date: 20-Jun-2008.
- Kedlaya K and Sutherland A Computing L-series of hyperelliptic curves Proceedings of the 8th international conference on Algorithmic number theory, (312-326)
- Belding J, Bröker R, Enge A and Lauter K Computing Hilbert class polynomials Proceedings of the 8th international conference on Algorithmic number theory, (282-295)
- Thongjunthug T Computing a lower bound for the canonical height on elliptic curves over totally real number fields Proceedings of the 8th international conference on Algorithmic number theory, (139-152)
- Gama N and Nguyen P Finding short lattice vectors within mordell's inequality Proceedings of the fortieth annual ACM symposium on Theory of computing, (207-216)
- Akhavi A and Stehlé D Speeding-up lattice reduction with random projections Proceedings of the 8th Latin American conference on Theoretical informatics, (293-305)
- Plantard T, Susilo W and Win K A digital signature scheme based on CV P∞ Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography, (288-307)
- Huang X, Liang C and Ma J (2008). System architecture and implementation of MIMO sphere decoders on FPGA, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16:2, (188-197), Online publication date: 1-Feb-2008.
- Micciancio D Efficient reductions among lattice problems Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (84-93)
- Di Crescenzo G and Saraswat V Public key encryption with searchable keywords based on Jacobi symbols Proceedings of the cryptology 8th international conference on Progress in cryptology, (282-296)
- Kanayama N and Uchiyama S (2007). The Vanstone-Zuccherato Schemes Revisited, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:12, (2903-2907), Online publication date: 1-Dec-2007.
- Backes W and Wetzel S An efficient LLL gram using buffered transformations Proceedings of the 10th international conference on Computer Algebra in Scientific Computing, (31-44)
- Meurice De Dormale G, Bulens P and Quisquater J Collision Search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems, (378-393)
- Joye M Highly Regular Right-to-Left Algorithms for Scalar Multiplication Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems, (135-147)
- Jafarisiavoshani M, Fragouli C, Diggavi S and Gkantsidis C Bottleneck discovery and overlay management in network coded peer-to-peer systems Proceedings of the 2007 SIGCOMM workshop on Internet network management, (293-298)
- Fan X and Gong G Efficient explicit formulae for genus 2 hyperelliptic curves over prime fields and their implementations Proceedings of the 14th international conference on Selected areas in cryptography, (155-172)
- Villard G Certification of the QR factor R and of lattice basis reducedness Proceedings of the 2007 international symposium on Symbolic and algebraic computation, (361-368)
- Peikert C and Rosen A Lattices that admit logarithmic worst-case to average-case connection factors Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (478-487)
- Haviv I and Regev O Tensor-based hardness of the shortest vector problem to within almost polynomial factors Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (469-477)
- Shirase M, Han D, Hibino Y, Kim H and Takagi T Compressed XTR Proceedings of the 5th international conference on Applied Cryptography and Network Security, (420-431)
- Casagrande A, Corvaja P, Piazza C and Mishra B Composing semi-algebraic O-minimal automata Proceedings of the 10th international conference on Hybrid systems: computation and control, (668-671)
- Hallgren S (2007). Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem, Journal of the ACM, 54:1, (1-19), Online publication date: 1-Mar-2007.
- Khabbazian M, Gulliver T and Bhargava V (2007). Double Point Compression with Applications to Speeding Up Random Point Multiplication, IEEE Transactions on Computers, 56:3, (305-313), Online publication date: 1-Mar-2007.
- Childs A and van Dam W Quantum algorithm for a generalized hidden shift problem Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (1225-1232)
- Tetsushi M Development of NZMATH Proceedings of the Second international conference on Mathematical Software, (158-169)
- Gama N, Howgrave-Graham N, Koy H and Nguyen P Rankin's constant and blockwise lattice reduction Proceedings of the 26th annual international conference on Advances in Cryptology, (112-130)
- Joux A, Lercier R, Smart N and Vercauteren F The number field sieve in the medium prime case Proceedings of the 26th annual international conference on Advances in Cryptology, (326-344)
- Avanzi R Delaying and merging operations in scalar multiplication Proceedings of the 13th international conference on Selected areas in cryptography, (203-219)
- Eigenwillig A, Kettner L, Schömer E and Wolpert N (2006). Exact, efficient, and complete arrangement computation for cubic curves, Computational Geometry: Theory and Applications, 35:1-2, (36-73), Online publication date: 1-Aug-2006.
- Malle G The totally real primitive number fields of discriminant at most 109 Proceedings of the 7th international conference on Algorithmic Number Theory, (114-123)
- Jacobson M, Ramachandran S and Williams H Numerical results on class groups of imaginary quadratic fields Proceedings of the 7th international conference on Algorithmic Number Theory, (87-101)
- Bley W and Boltje R Computation of locally free class groups Proceedings of the 7th international conference on Algorithmic Number Theory, (72-86)
- Shallue A and van de Woestijne C Construction of rational points on elliptic curves over finite fields Proceedings of the 7th international conference on Algorithmic Number Theory, (510-524)
- Voight J Computing CM points on shimura curves arising from cocompact arithmetic triangle groups Proceedings of the 7th international conference on Algorithmic Number Theory, (406-420)
- Cremona J and Siksek S Computing a lower bound for the canonical height on elliptic curves over ℚ Proceedings of the 7th international conference on Algorithmic Number Theory, (275-286)
- Kim Y, Kim C and Youn T On the security of multilevel cryptosystems over class semigroups of imaginary quadratic non-maximal orders Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice, (92-100)
- Gama N, Howgrave-Graham N and Nguyen P Symplectic lattice reduction and NTRU Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (233-253)
- Kong F, Cai Z, Yu J and Li D (2006). Improved generalized Atkin algorithm for computing square roots in finite fields, Information Processing Letters, 98:1, (1-5), Online publication date: 15-Apr-2006.
- Castelluccia C, Mykletun E and Tsudik G Improving secure server performance by re-balancing SSL/TLS handshakes Proceedings of the 2006 ACM Symposium on Information, computer and communications security, (26-34)
- Weng A (2006). A Low-Memory Algorithm for Point Counting on Picard Curves, Designs, Codes and Cryptography, 38:3, (383-393), Online publication date: 1-Mar-2006.
- Briggs K (2006). Implementing exact real arithmetic in python, C++ and C, Theoretical Computer Science, 351:1, (74-81), Online publication date: 14-Feb-2006.
- Nuyens D and Cools R (2006). Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points, Journal of Complexity, 22:1, (4-28), Online publication date: 1-Feb-2006.
- Bentahar K The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited Proceedings of the 10th international conference on Cryptography and Coding, (376-391)
- Koblitz N and Menezes A Pairing-Based cryptography at high security levels Proceedings of the 10th international conference on Cryptography and Coding, (13-36)
- Kong F and Li D A note on signed binary window algorithm for elliptic curve cryptosystems Proceedings of the 4th international conference on Cryptology and Network Security, (223-235)
- Negre C Scalar multiplication on elliptic curves defined over fields of small odd characteristic Proceedings of the 6th international conference on Cryptology in India, (389-402)
- Monnerat J, Oswald Y and Vaudenay S Optimization of the MOVA undeniable signature scheme Proceedings of the 1st international conference on Progress in Cryptology in Malaysia, (196-209)
- Chang N, Kim C, Park Y and Lim J A non-redundant and efficient architecture for karatsuba-ofman algorithm Proceedings of the 8th international conference on Information Security, (288-299)
- Borges-Quintana M, Borges-Trenard M and Martínez-Moro E On the use of gröbner bases for computing the structure of finite abelian groups Proceedings of the 8th international conference on Computer Algebra in Scientific Computing, (52-64)
- Coron J, Lefranc D and Poupard G A new baby-step giant-step algorithm and some applications to cryptanalysis Proceedings of the 7th international conference on Cryptographic hardware and embedded systems, (47-60)
- van de Woestijne C Deterministic equation solving over finite fields Proceedings of the 2005 international symposium on Symbolic and algebraic computation, (348-353)
- Haneda M, Kawazoe M and Takahashi T Suitable curves for genus-4 HCC over prime fields Proceedings of the 32nd international conference on Automata, Languages and Programming, (539-550)
- Wollinger T, Pelzl J and Paar C (2005). Cantor versus Harley, IEEE Transactions on Computers, 54:7, (861-872), Online publication date: 1-Jul-2005.
- Hallgren S Fast quantum algorithms for computing the unit group and class group of a number field Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (468-474)
- Fouque P, Granboulan L and Stern J Differential cryptanalysis for multivariate schemes Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (341-353)
- Nguên P and Stehlé D Floating-Point LLL revisited Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (215-233)
- Kim H, Park B, Ha J, Lee B and Park D New key management systems for multilevel security Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II, (245-253)
- Wang S and Laih C (2005). Cryptanalyses of two key assignment schemes based on polynomial interpolations, Computers and Security, 24:2, (134-138), Online publication date: 1-Mar-2005.
- Konstantinou E, Kontogeorgis A, Stamatiou Y and Zaroliagis C Generating prime order elliptic curves Proceedings of the 7th international conference on Information Security and Cryptology, (261-278)
- Doërr G, Dugelay J and Grangé L Exploiting self-similarities to defeat digital watermarking systems Proceedings of the 2004 workshop on Multimedia and security, (133-142)
- Wollinger T, Pelzl J, Wittelsberger V, Paar C, Saldamli G and Koç Ç (2004). Elliptic and hyperelliptic curves on embedded μP, ACM Transactions on Embedded Computing Systems, 3:3, (509-533), Online publication date: 1-Aug-2004.
- van der Heiden G (2004). Factoring polynomials over finite fields with drinfeld modules, Mathematics of Computation, 73:245, (317-322), Online publication date: 1-Jan-2004.
- Hühnlein D, Jacobson M and Weber D (2003). Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders, Designs, Codes and Cryptography, 30:3, (281-299), Online publication date: 1-Nov-2003.
- Kim H and Moon S Public-key cryptosystems based on class semigroups of imaginary quadratic non-maximal orders Proceedings of the 8th Australasian conference on Information security and privacy, (488-497)
- Eick B and Ostheimer G (2003). On the orbit-stabilizer problem for integral matrix actions of polycyclic groups, Mathematics of Computation, 72:243, (1511-1529), Online publication date: 1-Jul-2003.
- Heß F, Pauli S and Pohst M (2003). Computing the multiplicative group of residue class rings, Mathematics of Computation, 72:243, (1531-1548), Online publication date: 1-Jul-2003.
- Cremona J and Rusin D (2003). Efficient solution of rational conics, Mathematics of Computation, 72:243, (1417-1441), Online publication date: 1-Jul-2003.
- Hsu C and Wu T (2003). Refereed paper, Computers and Security, 22:5, (453-456), Online publication date: 1-Jul-2003.
- Brier E and Joye M Fast point multiplication on elliptic curves through isogenies Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes, (43-50)
- Szydlo M Hypercubic lattice reduction and analysis of GGH and NTRU signatures Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (433-448)
- Ciet M, Lange T, Sica F and Quisquater J Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (388-400)
- Courtois N and Patarin J About the XL algorithm over GF(2) Proceedings of the 2003 RSA conference on The cryptographers' track, (141-157)
- Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
- Agou S, Deléglise M and Nicolas J (2003). Short Polynomial Representations for Square Roots Modulo p, Designs, Codes and Cryptography, 28:1, (33-44), Online publication date: 1-Jan-2003.
- Backes W and Wetzel S (2002). Heuristics on lattice basis reduction in practice, ACM Journal of Experimental Algorithmics, 7, (1), Online publication date: 31-Dec-2003.
- Aardal K, Weismantel R and Wolsey L (2002). Non-standard approaches to integer programming, Discrete Applied Mathematics, 123:1-3, (5-74), Online publication date: 15-Nov-2002.
- Monico C (2002). Computing the Primary Decomposition of Zero-dimensional Ideals, Journal of Symbolic Computation, 34:5, (451-459), Online publication date: 1-Nov-2002.
- Zhang Z (2002). A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Mathematics of Computation, 71:240, (1699-1734), Online publication date: 1-Oct-2002.
- Jacobson M and Williams H (2002). Modular Arithmetic on Elements of Small Norm in Quadratic Fields, Designs, Codes and Cryptography, 27:1-2, (93-110), Online publication date: 1-Oct-2002.
- Eick B (2002). Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups, Journal of Symbolic Computation, 34:1, (1-19), Online publication date: 1-Jul-2002.
- Hallgren S Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (653-658)
- Fouque P, Stern J and Wackers G Cryptocomputing with rationals Proceedings of the 6th international conference on Financial cryptography, (136-146)
- Biehl I, Buchmann J, Hamdy S and Meyer A (2002). A Signature Scheme Based on the Intractability of Computing Roots, Designs, Codes and Cryptography, 25:3, (223-236), Online publication date: 1-Mar-2002.
- Caldwell C and Gallot Y (2002). On the primality of n! ± 1 and 2×3×5×...× p±1, Mathematics of Computation, 71:237, (441-448), Online publication date: 1-Jan-2002.
- Galbraith S, Paulus S and Smart N (2002). Arithmetic on superelliptic curves, Mathematics of Computation, 71:237, (393-405), Online publication date: 1-Jan-2002.
- Mao W (2001). Verifiable Partial Escrow of Integer Factors, Designs, Codes and Cryptography, 24:3, (327-342), Online publication date: 1-Dec-2001.
- Stephan F and Ventsov Y (2001). Learning algebraic structures from text, Theoretical Computer Science, 268:2, (221-273), Online publication date: 17-Oct-2001.
- Khandani A and Esmaeili M (2001). Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis, Designs, Codes and Cryptography, 24:2, (145-158), Online publication date: 1-Oct-2001.
- Giavitto J and Michel O Declarative definition of group indexed data structures and approximation of their domains Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (150-161)
- Watrous J Quantum algorithms for solvable groups Proceedings of the thirty-third annual ACM symposium on Theory of computing, (60-67)
- Hanrot G and Morain F Solvability by radicals from an algorithmic point of view Proceedings of the 2001 international symposium on Symbolic and algebraic computation, (175-182)
- Scheidler R (2001). Cryptography in Quadratic Function Fields, Designs, Codes and Cryptography, 22:3, (239-264), Online publication date: 1-Apr-2001.
- Joye M and Yen S (2000). Optimal Left-to-Right Binary Signed-Digit Recoding, IEEE Transactions on Computers, 49:7, (740-748), Online publication date: 1-Jul-2000.
- Jaulmes É and Joux A A NICE cryptanalysis Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (382-391)
- Poupard G and Stern J Fair encryption of RSA keys Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (172-189)
- Girault M and Misarsky J Cryptanalysis of countermeasures proposed for repairing ISO 9796-1 Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (81-90)
- Silverman J (2000). The Xedni Calculus and the Elliptic Curve Discrete LogarithmProblem, Designs, Codes and Cryptography, 20:1, (5-40), Online publication date: 1-Apr-2000.
- Lenstra A (2000). Integer Factoring, Designs, Codes and Cryptography, 19:2-3, (101-128), Online publication date: 1-Mar-2000.
- Jacobson M (2000). Computing Discrete Logarithms in Quadratic Orders, Journal of Cryptology, 13:4, (473-492), Online publication date: 1-Jan-2000.
- Pollard J (2000). Kangaroos, Monopoly and Discrete Logarithms, Journal of Cryptology, 13:4, (437-447), Online publication date: 1-Jan-2000.
- Silverman J Fast Multiplication in Finite Fields GF(2N) Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, (122-134)
- Kislenkov V, Mitrofanov V and Zima E How fast can we compute products? Proceedings of the 1999 international symposium on Symbolic and algebraic computation, (75-82)
- Smart N On the performance of hyperelliptic cryptosystems Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (165-175)
- Camenisch J and Michels M Proving in zero-knowledge that a number is the product of two safe primes Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (107-122)
- Rojas J On the complexity of diophantine geometry in low dimensions (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (527-536)
- Shokrollahi M and Wasserman H Decoding algebraic-geometric codes beyond the error-correction bound Proceedings of the thirtieth annual ACM symposium on Theory of computing, (241-248)
- Besch M and Pohl H A group theoretic approach to data and code partitioning Proceedings of the 1998 ACM symposium on Applied Computing, (575-583)
- Giesbrecht M Efficient parallel solution of sparse systems of linear diophantine equations Proceedings of the second international symposium on Parallel symbolic computation, (1-10)
- Gianni P and Trager B Integral closure of Noetherian rings Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (212-216)
- Theobald P, Wetzel S and Backes W Design concepts for matrices and lattices in LiDIA Proceedings of the 1997 ACM symposium on Applied computing, (532-536)
- Joye M and Quisquater J On the importance of securing your bins Proceedings of the 4th ACM conference on Computer and communications security, (135-141)
- Weber A (1996). Computing radical expressions for roots of unity, ACM SIGSAM Bulletin, 30:3, (11-20), Online publication date: 1-Sep-1996.
- Babai L, Beals R, Cai J, Ivanyos G and Luks E Multiplicative equations over commuting matrices Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (498-507)
- Scheidler R, Stein A and Williams H (1996). Key-Exchange in Real Quadratic Congruence Function Fields, Designs, Codes and Cryptography, 7:1-2, (153-174), Online publication date: 1-Jan-1996.
- van Hoeij M An algorithm for computing the Weierstrass normal form Proceedings of the 1995 international symposium on Symbolic and algebraic computation, (90-95)
- Encarnación M On a modular algorithm for computing GCDs of polynomials over algebraic number fields Proceedings of the international symposium on Symbolic and algebraic computation, (58-65)
Index Terms
- A course in computational algebraic number theory
Recommendations
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information ...
Algebraic structures on double and plane posets
We study the Hopf algebra of double posets and two of its Hopf subalgebras, the Hopf algebras of plane posets and of posets "without N". We prove that they are free, cofree, self-dual, and we give an explicit Hopf pairing on these Hopf algebras. We also ...